./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekcba_aso.4.M1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekcba_aso.4.M1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e24bd3d387a8dc9f49a28dec971e10112e01621b85a87c6eb3a0cec4db0bef2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:15:38,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:15:38,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:15:38,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:15:38,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:15:38,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:15:38,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:15:38,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:15:38,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:15:38,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:15:39,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:15:39,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:15:39,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:15:39,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:15:39,000 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:15:39,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:15:39,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:15:39,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:15:39,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:15:39,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:15:39,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:15:39,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:15:39,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:15:39,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:15:39,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e24bd3d387a8dc9f49a28dec971e10112e01621b85a87c6eb3a0cec4db0bef2 [2025-02-07 21:15:39,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:15:39,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:15:39,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:15:39,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:15:39,296 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:15:39,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekcba_aso.4.M1.c [2025-02-07 21:15:40,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbf673ad3/eb32211e640f401789273713f814e422/FLAG9ae4109d7 [2025-02-07 21:15:41,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:15:41,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_aso.4.M1.c [2025-02-07 21:15:41,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbf673ad3/eb32211e640f401789273713f814e422/FLAG9ae4109d7 [2025-02-07 21:15:41,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbf673ad3/eb32211e640f401789273713f814e422 [2025-02-07 21:15:41,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:15:41,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:15:41,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:15:41,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:15:41,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:15:41,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:15:41" (1/1) ... [2025-02-07 21:15:41,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3e910c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:41, skipping insertion in model container [2025-02-07 21:15:41,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:15:41" (1/1) ... [2025-02-07 21:15:41,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:15:41,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_aso.4.M1.c[2061,2074] [2025-02-07 21:15:41,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:15:41,770 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:15:41,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/aso.bug4.i","-S") [44] [2025-02-07 21:15:41,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_aso.4.M1.c[2061,2074] [2025-02-07 21:15:42,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:15:42,082 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:15:42,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42 WrapperNode [2025-02-07 21:15:42,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:15:42,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:15:42,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:15:42,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:15:42,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,419 INFO L138 Inliner]: procedures = 73, calls = 3160, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 6433 [2025-02-07 21:15:42,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:15:42,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:15:42,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:15:42,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:15:42,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,567 INFO L175 MemorySlicer]: Split 2493 memory accesses to 32 slices as follows [4, 8, 2, 7, 2, 8, 2, 50, 5, 3, 264, 272, 144, 112, 57, 57, 82, 105, 82, 105, 82, 105, 82, 105, 82, 105, 82, 105, 82, 105, 82, 105]. 11 percent of accesses are in the largest equivalence class. The 493 initializations are split as follows [0, 0, 0, 2, 0, 0, 2, 0, 2, 1, 24, 24, 2, 2, 1, 1, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27]. The 527 writes are split as follows [0, 4, 1, 3, 1, 4, 0, 26, 1, 1, 24, 24, 2, 2, 1, 1, 28, 26, 28, 26, 28, 26, 28, 26, 28, 26, 28, 26, 28, 26, 28, 26]. [2025-02-07 21:15:42,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:15:42,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:15:42,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:15:42,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:15:42,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (1/1) ... [2025-02-07 21:15:42,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:15:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:15:42,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:15:42,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:15:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:15:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_cmd_forward [2025-02-07 21:15:42,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_cmd_forward [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-07 21:15:42,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:15:42,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-07 21:15:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#30 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#31 [2025-02-07 21:15:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-07 21:15:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-07 21:15:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-02-07 21:15:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-07 21:15:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:15:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-07 21:15:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-02-07 21:15:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-02-07 21:15:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-07 21:15:42,921 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-07 21:15:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-07 21:15:42,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-07 21:15:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_cmd_turn [2025-02-07 21:15:42,922 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_cmd_turn [2025-02-07 21:15:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-02-07 21:15:42,922 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:15:42,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:15:42,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts3 [2025-02-07 21:15:42,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts3 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:15:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:15:42,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-07 21:15:42,924 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_cmd_forward [2025-02-07 21:15:42,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_cmd_forward [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_obstacle_flag [2025-02-07 21:15:42,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_obstacle_flag [2025-02-07 21:15:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:15:42,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-07 21:15:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:15:42,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:15:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-07 21:15:42,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-07 21:15:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-07 21:15:42,931 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-07 21:15:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:15:42,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:15:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_cmd_turn [2025-02-07 21:15:42,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_cmd_turn [2025-02-07 21:15:43,622 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:15:43,625 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:15:44,141 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: OSEK_Task_ts1_~tmp___2~0#1 := (if 0 == OSEK_Task_ts1_#t~ret39#1 % 256 then 0 else 1);havoc OSEK_Task_ts1_#t~ret39#1;OSEK_Task_ts1_~lobstacle~0#1 := (if 0 == OSEK_Task_ts1_~tmp___2~0#1 % 256 then 0 else 1); [2025-02-07 21:15:44,141 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283-1: SUMMARY for call OSEK_Task_ts1_#t~ret39#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:15:44,141 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: call OSEK_Task_ts1_#t~mem47#1 := read~int#4(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset, 1); [2025-02-07 21:15:44,141 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L300-1: SUMMARY for call nxt_motor_set_speed(0, OSEK_Task_ts1_#t~mem46#1, 1); srcloc: null [2025-02-07 21:15:44,141 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1729: assume 0 != __startrek_assert_i0_~arg#1 % 256; [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1729: assume !(0 != __startrek_assert_i0_~arg#1 % 256); [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: havoc ecrobot_sound_tone_~arg0#1, ecrobot_sound_tone_~arg1#1, ecrobot_sound_tone_~arg2#1;havoc ecrobot_sound_tone_#in~arg0#1, ecrobot_sound_tone_#in~arg1#1, ecrobot_sound_tone_#in~arg2#1;assume { :end_inline_ecrobot_sound_tone } true; [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: SUMMARY for call nxt_motor_set_speed(1, OSEK_Task_ts1_#t~mem47#1, 1); srcloc: null [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: OSEK_Task_ts1_#t~ret42#1 := ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet29#1, ecrobot_get_battery_voltage_~tmp~3#1;assume { :end_inline_ecrobot_get_battery_voltage } true;OSEK_Task_ts1_~tmp___6~0#1 := OSEK_Task_ts1_#t~ret42#1; [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L293-1: assume { :begin_inline_ecrobot_get_battery_voltage } true;havoc ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet29#1, ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_#t~nondet29#1;ecrobot_get_battery_voltage_~tmp~3#1 := ecrobot_get_battery_voltage_#t~nondet29#1;havoc ecrobot_get_battery_voltage_#t~nondet29#1;ecrobot_get_battery_voltage_#res#1 := ecrobot_get_battery_voltage_~tmp~3#1; [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume -128 <= OSEK_Task_ts1_#t~ret40#1 && OSEK_Task_ts1_#t~ret40#1 <= 127;OSEK_Task_ts1_~tmp___3~0#1 := OSEK_Task_ts1_#t~ret40#1;havoc OSEK_Task_ts1_#t~ret40#1;~task_cmd_turn~0 := OSEK_Task_ts1_~tmp___3~0#1; [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: SUMMARY for call OSEK_Task_ts1_#t~ret40#1 := __startrek_read_cmd_turn(); srcloc: null [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: SUMMARY for call __startrek_write_nxtway_gs_mode(2); srcloc: null [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739-1: assume __startrek_assert_i0_#t~switch1260#1;call write~int#8(0, ~#__startrek_Assert_t1_i0~0.base, ~#__startrek_Assert_t1_i0~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739-1: assume !__startrek_assert_i0_#t~switch1260#1;__startrek_assert_i0_#t~switch1260#1 := __startrek_assert_i0_#t~switch1260#1 || 2 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L294: assume -128 <= OSEK_Task_ts1_#t~ret43#1 && OSEK_Task_ts1_#t~ret43#1 <= 127;OSEK_Task_ts1_~tmp___7~0#1 := OSEK_Task_ts1_#t~ret43#1; [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L294-1: SUMMARY for call OSEK_Task_ts1_#t~ret43#1 := nxt_motor_get_count(1); srcloc: null [2025-02-07 21:15:44,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L295: assume -128 <= OSEK_Task_ts1_#t~ret44#1 && OSEK_Task_ts1_#t~ret44#1 <= 127;OSEK_Task_ts1_~tmp___8~0#1 := OSEK_Task_ts1_#t~ret44#1; [2025-02-07 21:15:44,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L295-1: SUMMARY for call OSEK_Task_ts1_#t~ret44#1 := nxt_motor_get_count(0); srcloc: null [2025-02-07 21:15:44,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: assume { :end_inline_balance_init } true; [2025-02-07 21:15:44,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1732: assume (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296) < (if ~__startrek_error_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_error_round~0 % 256 % 4294967296 else ~__startrek_error_round~0 % 256 % 4294967296 - 4294967296);~__startrek_error_round~0 := ~__startrek_round~0; [2025-02-07 21:15:44,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1732: assume !((if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296) < (if ~__startrek_error_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_error_round~0 % 256 % 4294967296 else ~__startrek_error_round~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:15:44,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT((~K_I~0 * ~ud_err_theta~0 + balance_control_~tmp_pwm_r_limiter~0#1) % 4294967296 / ((~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296)), 100.0));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_turn#1), 100.0), ~convertUINTToFLOAT(~K_PHIDOT~0)));balance_control_~tmp_pwm_l_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + balance_control_~tmp_pwm_turn~0#1;havoc balance_control_#t~nondet20#1;assume -2147483648 <= balance_control_#t~nondet20#1 && balance_control_#t~nondet20#1 <= 2147483647;balance_control_~tmp___0~0#1 := balance_control_#t~nondet20#1;havoc balance_control_#t~nondet20#1;balance_control_~tmp_pwm_l_limiter~0#1 := balance_control_~tmp___0~0#1;call write~int#2((if balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, 1);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 - balance_control_~tmp_pwm_turn~0#1;havoc balance_control_#t~nondet21#1;assume -2147483648 <= balance_control_#t~nondet21#1 && balance_control_#t~nondet21#1 <= 2147483647;balance_control_~tmp___1~0#1 := balance_control_#t~nondet21#1;havoc balance_control_#t~nondet21#1;balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp___1~0#1;call write~int#4((if balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, 1);balance_control_~tmp_pwm_l_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_thetadot_cmd_lpf~0#1)), ~convertUINTToFLOAT(~ud_theta_ref~0)));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_psidot~0#1)), ~convertUINTToFLOAT(~ud_psi~0)));balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(~ud_theta_ref~0 - balance_control_~tmp_theta~0#1), 0.00400000019), ~convertUINTToFLOAT(~ud_err_theta~0)));~ud_err_theta~0 := balance_control_~tmp_pwm_r_limiter~0#1;~ud_theta_ref~0 := balance_control_~tmp_pwm_l_limiter~0#1;~ud_thetadot_cmd_lpf~0 := balance_control_~tmp_thetadot_cmd_lpf~0#1;~ud_psi~0 := balance_control_~tmp_pwm_turn~0#1;~ud_theta_lpf~0 := balance_control_~tmp_theta_lpf~0#1;call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-02-07 21:15:44,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130-1: SUMMARY for call assume_abort_if_not((if 0 != (~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296 then 1 else 0)); srcloc: null [2025-02-07 21:15:44,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L287: assume -128 <= OSEK_Task_ts1_#t~ret41#1 && OSEK_Task_ts1_#t~ret41#1 <= 127;OSEK_Task_ts1_~tmp___4~0#1 := OSEK_Task_ts1_#t~ret41#1;havoc OSEK_Task_ts1_#t~ret41#1;~task_cmd_forward~0 := OSEK_Task_ts1_~tmp___4~0#1; [2025-02-07 21:15:44,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L287-1: SUMMARY for call OSEK_Task_ts1_#t~ret41#1 := __startrek_read_cmd_forward(); srcloc: null [2025-02-07 21:15:44,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L296: OSEK_Task_ts1_~tmp___9~0#1 := OSEK_Task_ts1_#t~ret45#1;assume { :begin_inline_balance_control } true;balance_control_#in~args_cmd_forward#1, balance_control_#in~args_cmd_turn#1, balance_control_#in~args_gyro#1, balance_control_#in~args_gyro_offset#1, balance_control_#in~args_theta_m_l#1, balance_control_#in~args_theta_m_r#1, balance_control_#in~args_battery#1, balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset, balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset := ~task_cmd_forward~0, ~task_cmd_turn~0, OSEK_Task_ts1_~tmp___9~0#1, ~gyro_offset~0, OSEK_Task_ts1_~tmp___8~0#1, OSEK_Task_ts1_~tmp___7~0#1, OSEK_Task_ts1_~tmp___6~0#1, OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;balance_control_~args_cmd_forward#1 := balance_control_#in~args_cmd_forward#1;balance_control_~args_cmd_turn#1 := balance_control_#in~args_cmd_turn#1;balance_control_~args_gyro#1 := balance_control_#in~args_gyro#1;balance_control_~args_gyro_offset#1 := balance_control_#in~args_gyro_offset#1;balance_control_~args_theta_m_l#1 := balance_control_#in~args_theta_m_l#1;balance_control_~args_theta_m_r#1 := balance_control_#in~args_theta_m_r#1;balance_control_~args_battery#1 := balance_control_#in~args_battery#1;balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset := balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset;balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset := balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;havoc balance_control_~tmp_theta~0#1;havoc balance_control_~tmp_theta_lpf~0#1;havoc balance_control_~tmp_pwm_r_limiter~0#1;havoc balance_control_~tmp_psidot~0#1;havoc balance_control_~tmp_pwm_turn~0#1;havoc balance_control_~tmp_pwm_l_limiter~0#1;havoc balance_control_~tmp_thetadot_cmd_lpf~0#1;call balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset := #Ultimate.allocOnStack(16);call balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset := #Ultimate.allocOnStack(16);havoc balance_control_~tmp_0~0#1;havoc balance_control_~tmp___0~0#1;havoc balance_control_~tmp___1~0#1;balance_control_~tmp_thetadot_cmd_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_forward#1), 100.0), ~convertUINTToFLOAT(~K_THETADOT~0)), ~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_R~0))), ~convertUINTToFLOAT(~A_R~0 * ~ud_thetadot_cmd_lpf~0)));balance_control_~tmp_theta~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_l#1)), ~convertUINTToFLOAT(~ud_psi~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_r#1)), ~convertUINTToFLOAT(~ud_psi~0))), 0.5));balance_control_~tmp_theta_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_D~0)), ~convertUINTToFLOAT(balance_control_~tmp_theta~0#1)), ~convertUINTToFLOAT(~A_D~0 * ~ud_theta_lpf~0)));balance_control_~tmp_psidot~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_gyro#1 - balance_control_~args_gyro_offset#1), 0.01745329238));call write~int#5(~ud_theta_ref~0, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, 4);call write~int#5(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 4 + balance_control_~#tmp~0#1.offset, 4);call write~int#5(balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, 8 + balance_control_~#tmp~0#1.offset, 4);call write~int#5(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 12 + balance_control_~#tmp~0#1.offset, 4);call write~int#1(balance_control_~tmp_theta~0#1, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#1(~ud_psi~0, balance_control_~#tmp_theta_0~0#1.base, 4 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#1(~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~tmp_theta_lpf~0#1 - ~ud_theta_lpf~0), 0.00400000019)), balance_control_~#tmp_theta_0~0#1.base, 8 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#1(balance_control_~tmp_psidot~0#1, balance_control_~#tmp_theta_0~0#1.base, 12 + balance_control_~#tmp_theta_0~0#1.offset, 4);balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(0.0);balance_control_~tmp_0~0#1 := 0;call balance_control_#t~mem4#1 := read~int#5(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem5#1 := read~int#1(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem6#1 := read~int#0(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem4#1 - balance_control_#t~mem5#1) * balance_control_#t~mem6#1;havoc balance_control_#t~mem4#1;havoc balance_control_#t~mem5#1;havoc balance_control_#t~mem6#1;balance_control_#t~post7#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post7#1;havoc balance_control_#t~post7#1;call balance_control_#t~mem8#1 := read~int#5(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem9#1 := read~int#1(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem10#1 := read~int#0(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem8#1 - balance_control_#t~mem9#1) * balance_control_#t~mem10#1;havoc balance_control_#t~mem8#1;havoc balance_control_#t~mem9#1;havoc balance_control_#t~mem10#1;balance_control_#t~post11#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post11#1;havoc balance_control_#t~post11#1;call balance_control_#t~mem12#1 := read~int#5(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem13#1 := read~int#1(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem14#1 := read~int#0(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem12#1 - balance_control_#t~mem13#1) * balance_control_#t~mem14#1;havoc balance_control_#t~mem12#1;havoc balance_control_#t~mem13#1;havoc balance_control_#t~mem14#1;balance_control_#t~post15#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post15#1;havoc balance_control_#t~post15#1;call balance_control_#t~mem16#1 := read~int#5(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem17#1 := read~int#1(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem18#1 := read~int#0(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem16#1 - balance_control_#t~mem17#1) * balance_control_#t~mem18#1;havoc balance_control_#t~mem16#1;havoc balance_control_#t~mem17#1;havoc balance_control_#t~mem18#1;balance_control_#t~post19#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post19#1;havoc balance_control_#t~post19#1; [2025-02-07 21:15:44,150 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L296-1: SUMMARY for call OSEK_Task_ts1_#t~ret45#1 := ecrobot_get_gyro_sensor(3); srcloc: null [2025-02-07 21:15:44,150 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: SUMMARY for call nxt_motor_set_count(0, 0); srcloc: null [2025-02-07 21:15:44,150 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280-1: assume 0 != OSEK_Task_ts1_~lobstacle~0#1 % 256;assume { :begin_inline___startrek_assert_i0 } true;__startrek_assert_i0_#in~arg#1 := (if 0 == (if -100 == ~task_cmd_forward~0 && 0 == ~task_cmd_turn~0 then 1 else 0) then 0 else 1);havoc __startrek_assert_i0_#t~switch1260#1, __startrek_assert_i0_~arg#1;__startrek_assert_i0_~arg#1 := __startrek_assert_i0_#in~arg#1; [2025-02-07 21:15:44,150 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280-1: assume !(0 != OSEK_Task_ts1_~lobstacle~0#1 % 256); [2025-02-07 21:15:44,150 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280-2: assume 0 == OSEK_Task_ts1_~tmp___5~0#1 % 256; [2025-02-07 21:15:44,150 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280-2: assume !(0 == OSEK_Task_ts1_~tmp___5~0#1 % 256); [2025-02-07 21:15:44,151 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-1: assume __startrek_assert_i0_#t~switch1260#1;call write~int#7(0, ~#__startrek_Assert_t2_i0~0.base, ~#__startrek_Assert_t2_i0~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-1: assume !__startrek_assert_i0_#t~switch1260#1;havoc __startrek_assert_i0_#t~switch1260#1;havoc __startrek_assert_i0_#t~switch1260#1;havoc __startrek_assert_i0_#t~switch1260#1, __startrek_assert_i0_~arg#1;havoc __startrek_assert_i0_#in~arg#1;assume { :end_inline___startrek_assert_i0 } true; [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: SUMMARY for call nxt_motor_set_count(1, 0); srcloc: null [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1726: assume 0 != (if ~__startrek_hyper_period~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_hyper_period~0 % 256 % 4294967296 else ~__startrek_hyper_period~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1726: assume !(0 != (if ~__startrek_hyper_period~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_hyper_period~0 % 256 % 4294967296 else ~__startrek_hyper_period~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: OSEK_Task_ts1_#t~ret38#1 := __startrek_read_trans_#res#1;havoc __startrek_read_trans_#t~switch1810#1, __startrek_read_trans_#t~ret1811#1, __startrek_read_trans_#t~ret1812#1, __startrek_read_trans_#t~ret1813#1, __startrek_read_trans_#t~mem1814#1, __startrek_read_trans_~r1~5#1, __startrek_read_trans_~c2~5#1, __startrek_read_trans_~or3~5#1;assume { :end_inline___startrek_read_trans } true;OSEK_Task_ts1_~tmp___5~0#1 := (if 0 == OSEK_Task_ts1_#t~ret38#1 % 256 then 0 else 1); [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: ~cal_start_time~0 := OSEK_Task_ts1_#t~ret34#1; [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265-1: SUMMARY for call OSEK_Task_ts1_#t~ret34#1 := ecrobot_get_systick_ms(); srcloc: null [2025-02-07 21:15:44,152 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: SUMMARY for call __startrek_write_nxtway_gs_mode(1); srcloc: null [2025-02-07 21:15:44,153 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736-1: assume __startrek_assert_i0_#t~switch1260#1;call write~int#9(0, ~#__startrek_Assert_t0_i0~0.base, ~#__startrek_Assert_t0_i0~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:15:44,153 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736-1: assume !__startrek_assert_i0_#t~switch1260#1;__startrek_assert_i0_#t~switch1260#1 := __startrek_assert_i0_#t~switch1260#1 || 1 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,153 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736-2: __startrek_assert_i0_#t~switch1260#1 := 0 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,153 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;havoc balance_control_#in~args_cmd_forward#1, balance_control_#in~args_cmd_turn#1, balance_control_#in~args_gyro#1, balance_control_#in~args_gyro_offset#1, balance_control_#in~args_theta_m_l#1, balance_control_#in~args_theta_m_r#1, balance_control_#in~args_battery#1, balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset, balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;assume { :end_inline_balance_control } true;call OSEK_Task_ts1_#t~mem46#1 := read~int#2(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, 1); [2025-02-07 21:15:44,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: __startrek_write_trans_~c2~13#1 := (if 0 == __startrek_write_trans_#t~ret1847#1 % 256 then 0 else 1);havoc __startrek_write_trans_#t~ret1847#1; [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-1: SUMMARY for call __startrek_write_trans_#t~ret1847#1 := __startrek_cs_t1(); srcloc: null [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2868-1: assume __startrek_write_trans_#t~switch1845#1;__startrek_write_trans_~or3~13#1 := ~__startrek_round~0; [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2868-1: assume !__startrek_write_trans_#t~switch1845#1;__startrek_write_trans_#t~switch1845#1 := __startrek_write_trans_#t~switch1845#1 || 1 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: assume { :begin_inline___startrek_write_trans } true;__startrek_write_trans_#in~arg#1 := 0;havoc __startrek_write_trans_#t~switch1845#1, __startrek_write_trans_#t~ret1846#1, __startrek_write_trans_#t~ret1847#1, __startrek_write_trans_#t~ret1848#1, __startrek_write_trans_~arg#1, __startrek_write_trans_~c2~13#1, __startrek_write_trans_~or3~13#1;__startrek_write_trans_~arg#1 := __startrek_write_trans_#in~arg#1;havoc __startrek_write_trans_~c2~13#1;havoc __startrek_write_trans_~or3~13#1;__startrek_write_trans_#t~switch1845#1 := 0 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L333-1: SUMMARY for call __startrek_write_cmd_turn(0); srcloc: null [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2889-1: SUMMARY for call __startrek_write_trans_#t~ret1848#1 := __startrek_cs_t2(); srcloc: null [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: OSEK_Task_ts2_#t~ret50#1 := ecrobot_get_sonar_sensor_#res#1;havoc ecrobot_get_sonar_sensor_#t~nondet48#1, ecrobot_get_sonar_sensor_~port#1, ecrobot_get_sonar_sensor_~tmp~5#1;havoc ecrobot_get_sonar_sensor_#in~port#1;assume { :end_inline_ecrobot_get_sonar_sensor } true;OSEK_Task_ts2_~tmp___0~2#1 := OSEK_Task_ts2_#t~ret50#1;havoc OSEK_Task_ts2_#t~ret50#1; [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2889: __startrek_write_trans_~c2~13#1 := (if 0 == __startrek_write_trans_#t~ret1848#1 % 256 then 0 else 1);havoc __startrek_write_trans_#t~ret1848#1; [2025-02-07 21:15:44,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-1: assume __startrek_write_trans_#t~switch1845#1;__startrek_write_trans_~or3~13#1 := ~__startrek_round~0; [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-1: assume !__startrek_write_trans_#t~switch1845#1;__startrek_write_trans_#t~switch1845#1 := __startrek_write_trans_#t~switch1845#1 || 2 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume (if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25; [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !((if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25); [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886-1: assume __startrek_write_trans_#t~switch1845#1;__startrek_write_trans_~or3~13#1 := ~__startrek_round~0; [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886-1: assume !__startrek_write_trans_#t~switch1845#1;havoc __startrek_write_trans_#t~switch1845#1;havoc __startrek_write_trans_#t~switch1845#1;call write~int#26((if 0 == __startrek_write_trans_~arg#1 % 256 then 0 else 1), ~#_trans_~0.base, ~#_trans_~0.offset + (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296), 1);havoc __startrek_write_trans_#t~switch1845#1, __startrek_write_trans_#t~ret1846#1, __startrek_write_trans_#t~ret1847#1, __startrek_write_trans_#t~ret1848#1, __startrek_write_trans_~arg#1, __startrek_write_trans_~c2~13#1, __startrek_write_trans_~or3~13#1;havoc __startrek_write_trans_#in~arg#1;assume { :end_inline___startrek_write_trans } true; [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L331: SUMMARY for call __startrek_write_obstacle_flag(1); srcloc: null [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2871-1: SUMMARY for call __startrek_write_trans_#t~ret1846#1 := __startrek_cs_t0(); srcloc: null [2025-02-07 21:15:44,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2871: __startrek_write_trans_~c2~13#1 := (if 0 == __startrek_write_trans_#t~ret1846#1 % 256 then 0 else 1);havoc __startrek_write_trans_#t~ret1846#1; [2025-02-07 21:15:44,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: SUMMARY for call __startrek_write_cmd_forward(-100); srcloc: null [2025-02-07 21:15:44,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: assume -128 <= OSEK_Task_ts3_#t~ret58#1 && OSEK_Task_ts3_#t~ret58#1 <= 127;OSEK_Task_ts3_~tmp___2~1#1 := OSEK_Task_ts3_#t~ret58#1;havoc OSEK_Task_ts3_#t~ret58#1;assume { :begin_inline_ecrobot_bt_data_logger } true;ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1 := OSEK_Task_ts3_~tmp___2~1#1, OSEK_Task_ts3_~tmp___1~2#1;havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;ecrobot_bt_data_logger_~arg0#1 := ecrobot_bt_data_logger_#in~arg0#1;ecrobot_bt_data_logger_~arg1#1 := ecrobot_bt_data_logger_#in~arg1#1; [2025-02-07 21:15:44,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374-1: SUMMARY for call OSEK_Task_ts3_#t~ret58#1 := __startrek_read_cmd_forward(); srcloc: null [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc OSEK_Task_ts3_#t~mem56#1;OSEK_Task_ts3_~wrote~0#1 := 1; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L368-1: SUMMARY for call __startrek_write_cmd_turn((if OSEK_Task_ts3_#t~mem56#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem56#1 % 256 % 256 else OSEK_Task_ts3_#t~mem56#1 % 256 % 256 - 256)); srcloc: null [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: havoc __startrek_get_pi_lock_~arg0#1;havoc __startrek_get_pi_lock_#in~arg0#1;assume { :end_inline___startrek_get_pi_lock } true; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc ecrobot_read_bt_packet_#t~nondet27#1, ecrobot_read_bt_packet_#t~nondet28#1, ecrobot_read_bt_packet_~bt_receive_buf#1.base, ecrobot_read_bt_packet_~bt_receive_buf#1.offset, ecrobot_read_bt_packet_~sz#1;havoc ecrobot_read_bt_packet_#in~bt_receive_buf#1.base, ecrobot_read_bt_packet_#in~bt_receive_buf#1.offset, ecrobot_read_bt_packet_#in~sz#1;assume { :end_inline_ecrobot_read_bt_packet } true;OSEK_Task_ts3_~wrote~0#1 := 0;assume { :begin_inline___startrek_get_pi_lock } true;__startrek_get_pi_lock_#in~arg0#1 := 0;havoc __startrek_get_pi_lock_~arg0#1;__startrek_get_pi_lock_~arg0#1 := __startrek_get_pi_lock_#in~arg0#1; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;havoc ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1;assume { :end_inline_ecrobot_bt_data_logger } true; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: assume -128 <= OSEK_Task_ts3_#t~ret57#1 && OSEK_Task_ts3_#t~ret57#1 <= 127;OSEK_Task_ts3_~tmp___1~2#1 := OSEK_Task_ts3_#t~ret57#1;havoc OSEK_Task_ts3_#t~ret57#1; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L373-1: SUMMARY for call OSEK_Task_ts3_#t~ret57#1 := __startrek_read_cmd_turn(); srcloc: null [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc __startrek_release_pi_lock_~arg0#1;havoc __startrek_release_pi_lock_#in~arg0#1;assume { :end_inline___startrek_release_pi_lock } true; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371-1: assume { :begin_inline___startrek_release_pi_lock } true;__startrek_release_pi_lock_#in~arg0#1 := 0;havoc __startrek_release_pi_lock_~arg0#1;__startrek_release_pi_lock_~arg0#1 := __startrek_release_pi_lock_#in~arg0#1; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: havoc OSEK_Task_ts3_#t~mem55#1;call OSEK_Task_ts3_#t~mem56#1 := read~int#3(~#bt_receive_buf~0.base, 1 + ~#bt_receive_buf~0.offset, 1); [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L367-1: SUMMARY for call __startrek_write_cmd_forward((if -(if OSEK_Task_ts3_#t~mem55#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem55#1 % 256 % 256 else OSEK_Task_ts3_#t~mem55#1 % 256 % 256 - 256) % 256 <= 127 then -(if OSEK_Task_ts3_#t~mem55#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem55#1 % 256 % 256 else OSEK_Task_ts3_#t~mem55#1 % 256 % 256 - 256) % 256 else -(if OSEK_Task_ts3_#t~mem55#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem55#1 % 256 % 256 else OSEK_Task_ts3_#t~mem55#1 % 256 % 256 - 256) % 256 - 256)); srcloc: null [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: OSEK_Task_ts3_~tmp___0~3#1 := (if 0 == OSEK_Task_ts3_#t~ret54#1 % 256 then 0 else 1); [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L365-1: SUMMARY for call OSEK_Task_ts3_#t~ret54#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-1: assume 0 != OSEK_Task_ts3_~wrote~0#1 % 256; [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-1: assume !(0 != OSEK_Task_ts3_~wrote~0#1 % 256); [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-2: assume 0 == OSEK_Task_ts3_~tmp___0~3#1 % 256;call OSEK_Task_ts3_#t~mem55#1 := read~int#3(~#bt_receive_buf~0.base, ~#bt_receive_buf~0.offset, 1); [2025-02-07 21:15:44,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-2: assume !(0 == OSEK_Task_ts3_~tmp___0~3#1 % 256); [2025-02-07 21:15:52,072 INFO L? ?]: Removed 245 outVars from TransFormulas that were not future-live. [2025-02-07 21:15:52,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:15:52,135 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:15:52,135 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:15:52,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:15:52 BoogieIcfgContainer [2025-02-07 21:15:52,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:15:52,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:15:52,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:15:52,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:15:52,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:15:41" (1/3) ... [2025-02-07 21:15:52,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e038553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:15:52, skipping insertion in model container [2025-02-07 21:15:52,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:42" (2/3) ... [2025-02-07 21:15:52,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e038553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:15:52, skipping insertion in model container [2025-02-07 21:15:52,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:15:52" (3/3) ... [2025-02-07 21:15:52,149 INFO L128 eAbstractionObserver]: Analyzing ICFG rekcba_aso.4.M1.c [2025-02-07 21:15:52,162 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:15:52,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekcba_aso.4.M1.c that has 24 procedures, 1554 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 21:15:52,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:15:52,288 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;@59ee7169, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:15:52,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:15:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 1494 states, 903 states have (on average 1.2524916943521596) internal successors, (1131), 936 states have internal predecessors, (1131), 552 states have call successors, (552), 15 states have call predecessors, (552), 15 states have return successors, (552), 552 states have call predecessors, (552), 552 states have call successors, (552) [2025-02-07 21:15:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1654 [2025-02-07 21:15:52,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:15:52,423 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:15:52,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:15:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:15:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1034401026, now seen corresponding path program 1 times [2025-02-07 21:15:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:15:52,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029530677] [2025-02-07 21:15:52,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:15:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:15:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1653 statements into 1 equivalence classes. [2025-02-07 21:15:54,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1653 of 1653 statements. [2025-02-07 21:15:54,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:15:54,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:15:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 115680 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 115200 trivial. 0 not checked. [2025-02-07 21:15:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:15:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029530677] [2025-02-07 21:15:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029530677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:15:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010873162] [2025-02-07 21:15:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:15:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:15:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:15:56,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:15:56,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:15:59,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1653 statements into 1 equivalence classes. [2025-02-07 21:16:00,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1653 of 1653 statements. [2025-02-07 21:16:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:00,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 6381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:16:00,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:16:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 115680 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 115200 trivial. 0 not checked. [2025-02-07 21:16:00,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:16:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010873162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:00,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:16:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 21:16:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448809165] [2025-02-07 21:16:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:00,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:16:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:00,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:16:00,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:16:00,403 INFO L87 Difference]: Start difference. First operand has 1494 states, 903 states have (on average 1.2524916943521596) internal successors, (1131), 936 states have internal predecessors, (1131), 552 states have call successors, (552), 15 states have call predecessors, (552), 15 states have return successors, (552), 552 states have call predecessors, (552), 552 states have call successors, (552) Second operand has 2 states, 2 states have (on average 226.0) internal successors, (452), 2 states have internal predecessors, (452), 2 states have call successors, (242), 2 states have call predecessors, (242), 1 states have return successors, (241), 1 states have call predecessors, (241), 2 states have call successors, (241) [2025-02-07 21:16:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:00,607 INFO L93 Difference]: Finished difference Result 2938 states and 4959 transitions. [2025-02-07 21:16:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:16:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 226.0) internal successors, (452), 2 states have internal predecessors, (452), 2 states have call successors, (242), 2 states have call predecessors, (242), 1 states have return successors, (241), 1 states have call predecessors, (241), 2 states have call successors, (241) Word has length 1653 [2025-02-07 21:16:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:00,631 INFO L225 Difference]: With dead ends: 2938 [2025-02-07 21:16:00,631 INFO L226 Difference]: Without dead ends: 1343 [2025-02-07 21:16:00,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1654 GetRequests, 1654 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:16:00,656 INFO L435 NwaCegarLoop]: 2215 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, 2215 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:00,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:16:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-02-07 21:16:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2025-02-07 21:16:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 819 states have (on average 1.2173382173382172) internal successors, (997), 847 states have internal predecessors, (997), 514 states have call successors, (514), 9 states have call predecessors, (514), 9 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2024 transitions. [2025-02-07 21:16:00,988 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2024 transitions. Word has length 1653 [2025-02-07 21:16:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:00,991 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2024 transitions. [2025-02-07 21:16:00,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 226.0) internal successors, (452), 2 states have internal predecessors, (452), 2 states have call successors, (242), 2 states have call predecessors, (242), 1 states have return successors, (241), 1 states have call predecessors, (241), 2 states have call successors, (241) [2025-02-07 21:16:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2024 transitions. [2025-02-07 21:16:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1654 [2025-02-07 21:16:01,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:01,053 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:01,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:16:01,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 21:16:01,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:01,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -923771471, now seen corresponding path program 1 times [2025-02-07 21:16:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:01,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331968607] [2025-02-07 21:16:01,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:02,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1653 statements into 1 equivalence classes. [2025-02-07 21:16:04,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1653 of 1653 statements. [2025-02-07 21:16:04,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:04,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 115680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115680 trivial. 0 not checked. [2025-02-07 21:16:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331968607] [2025-02-07 21:16:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331968607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849157638] [2025-02-07 21:16:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:12,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:12,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:12,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:12,182 INFO L87 Difference]: Start difference. First operand 1343 states and 2024 transitions. Second operand has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (242), 2 states have call predecessors, (242), 1 states have return successors, (241), 1 states have call predecessors, (241), 1 states have call successors, (241) [2025-02-07 21:16:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:12,574 INFO L93 Difference]: Finished difference Result 1349 states and 2029 transitions. [2025-02-07 21:16:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (242), 2 states have call predecessors, (242), 1 states have return successors, (241), 1 states have call predecessors, (241), 1 states have call successors, (241) Word has length 1653 [2025-02-07 21:16:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:12,595 INFO L225 Difference]: With dead ends: 1349 [2025-02-07 21:16:12,595 INFO L226 Difference]: Without dead ends: 1347 [2025-02-07 21:16:12,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:12,597 INFO L435 NwaCegarLoop]: 1997 mSDtfsCounter, 1344 mSDsluCounter, 5964 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 7961 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:12,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 7961 Invalid, 135 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-02-07 21:16:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2025-02-07 21:16:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 822 states have (on average 1.2165450121654502) internal successors, (1000), 850 states have internal predecessors, (1000), 514 states have call successors, (514), 10 states have call predecessors, (514), 10 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2027 transitions. [2025-02-07 21:16:12,791 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2027 transitions. Word has length 1653 [2025-02-07 21:16:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:12,795 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 2027 transitions. [2025-02-07 21:16:12,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (242), 2 states have call predecessors, (242), 1 states have return successors, (241), 1 states have call predecessors, (241), 1 states have call successors, (241) [2025-02-07 21:16:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2027 transitions. [2025-02-07 21:16:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1660 [2025-02-07 21:16:12,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:12,819 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:12,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:16:12,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:12,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1168231910, now seen corresponding path program 1 times [2025-02-07 21:16:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002831261] [2025-02-07 21:16:12,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:14,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1659 statements into 1 equivalence classes. [2025-02-07 21:16:15,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1659 of 1659 statements. [2025-02-07 21:16:15,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 115682 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115680 trivial. 0 not checked. [2025-02-07 21:16:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002831261] [2025-02-07 21:16:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002831261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:19,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388503204] [2025-02-07 21:16:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:19,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:19,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:19,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:19,074 INFO L87 Difference]: Start difference. First operand 1347 states and 2027 transitions. Second operand has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (243), 2 states have call predecessors, (243), 1 states have return successors, (242), 1 states have call predecessors, (242), 1 states have call successors, (242) [2025-02-07 21:16:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:19,404 INFO L93 Difference]: Finished difference Result 1353 states and 2032 transitions. [2025-02-07 21:16:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (243), 2 states have call predecessors, (243), 1 states have return successors, (242), 1 states have call predecessors, (242), 1 states have call successors, (242) Word has length 1659 [2025-02-07 21:16:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:19,420 INFO L225 Difference]: With dead ends: 1353 [2025-02-07 21:16:19,421 INFO L226 Difference]: Without dead ends: 1351 [2025-02-07 21:16:19,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:19,423 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1339 mSDsluCounter, 5968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:19,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 7968 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-02-07 21:16:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2025-02-07 21:16:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 825 states have (on average 1.2157575757575758) internal successors, (1003), 853 states have internal predecessors, (1003), 514 states have call successors, (514), 11 states have call predecessors, (514), 11 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2030 transitions. [2025-02-07 21:16:19,617 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2030 transitions. Word has length 1659 [2025-02-07 21:16:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:19,625 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2030 transitions. [2025-02-07 21:16:19,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (243), 2 states have call predecessors, (243), 1 states have return successors, (242), 1 states have call predecessors, (242), 1 states have call successors, (242) [2025-02-07 21:16:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2030 transitions. [2025-02-07 21:16:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1666 [2025-02-07 21:16:19,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:19,670 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:19,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:16:19,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:19,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2114226885, now seen corresponding path program 1 times [2025-02-07 21:16:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:19,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115462455] [2025-02-07 21:16:19,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:21,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1665 statements into 1 equivalence classes. [2025-02-07 21:16:22,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1665 of 1665 statements. [2025-02-07 21:16:22,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:22,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 115688 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 115684 trivial. 0 not checked. [2025-02-07 21:16:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115462455] [2025-02-07 21:16:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115462455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966024979] [2025-02-07 21:16:25,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:25,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:25,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:25,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:25,491 INFO L87 Difference]: Start difference. First operand 1351 states and 2030 transitions. Second operand has 6 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 2 states have call successors, (244), 2 states have call predecessors, (244), 1 states have return successors, (243), 1 states have call predecessors, (243), 1 states have call successors, (243) [2025-02-07 21:16:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:25,798 INFO L93 Difference]: Finished difference Result 1357 states and 2035 transitions. [2025-02-07 21:16:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 2 states have call successors, (244), 2 states have call predecessors, (244), 1 states have return successors, (243), 1 states have call predecessors, (243), 1 states have call successors, (243) Word has length 1665 [2025-02-07 21:16:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:25,814 INFO L225 Difference]: With dead ends: 1357 [2025-02-07 21:16:25,814 INFO L226 Difference]: Without dead ends: 1355 [2025-02-07 21:16:25,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:25,816 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1337 mSDsluCounter, 5968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:25,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 7968 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-02-07 21:16:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2025-02-07 21:16:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 828 states have (on average 1.214975845410628) internal successors, (1006), 856 states have internal predecessors, (1006), 514 states have call successors, (514), 12 states have call predecessors, (514), 12 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2033 transitions. [2025-02-07 21:16:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2033 transitions. Word has length 1665 [2025-02-07 21:16:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:25,961 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2033 transitions. [2025-02-07 21:16:25,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 2 states have call successors, (244), 2 states have call predecessors, (244), 1 states have return successors, (243), 1 states have call predecessors, (243), 1 states have call successors, (243) [2025-02-07 21:16:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2033 transitions. [2025-02-07 21:16:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1672 [2025-02-07 21:16:25,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:25,988 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:25,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:16:25,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:25,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash -473190862, now seen corresponding path program 1 times [2025-02-07 21:16:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223923560] [2025-02-07 21:16:25,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:27,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1671 statements into 1 equivalence classes. [2025-02-07 21:16:27,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1671 of 1671 statements. [2025-02-07 21:16:27,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:27,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 115698 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 115692 trivial. 0 not checked. [2025-02-07 21:16:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223923560] [2025-02-07 21:16:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223923560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:30,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:30,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:30,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408755634] [2025-02-07 21:16:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:30,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:30,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:30,992 INFO L87 Difference]: Start difference. First operand 1355 states and 2033 transitions. Second operand has 6 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (245), 2 states have call predecessors, (245), 1 states have return successors, (244), 1 states have call predecessors, (244), 1 states have call successors, (244) [2025-02-07 21:16:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:31,277 INFO L93 Difference]: Finished difference Result 1361 states and 2038 transitions. [2025-02-07 21:16:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (245), 2 states have call predecessors, (245), 1 states have return successors, (244), 1 states have call predecessors, (244), 1 states have call successors, (244) Word has length 1671 [2025-02-07 21:16:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:31,294 INFO L225 Difference]: With dead ends: 1361 [2025-02-07 21:16:31,294 INFO L226 Difference]: Without dead ends: 1359 [2025-02-07 21:16:31,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:31,297 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1335 mSDsluCounter, 5968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:31,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 7968 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-07 21:16:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1359. [2025-02-07 21:16:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 831 states have (on average 1.2141997593261131) internal successors, (1009), 859 states have internal predecessors, (1009), 514 states have call successors, (514), 13 states have call predecessors, (514), 13 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2036 transitions. [2025-02-07 21:16:31,468 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2036 transitions. Word has length 1671 [2025-02-07 21:16:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2036 transitions. [2025-02-07 21:16:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (245), 2 states have call predecessors, (245), 1 states have return successors, (244), 1 states have call predecessors, (244), 1 states have call successors, (244) [2025-02-07 21:16:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2036 transitions. [2025-02-07 21:16:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1678 [2025-02-07 21:16:31,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:31,503 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:31,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:16:31,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1796406559, now seen corresponding path program 1 times [2025-02-07 21:16:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440485550] [2025-02-07 21:16:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:32,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1677 statements into 1 equivalence classes. [2025-02-07 21:16:33,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1677 of 1677 statements. [2025-02-07 21:16:33,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:33,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 115712 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 115704 trivial. 0 not checked. [2025-02-07 21:16:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440485550] [2025-02-07 21:16:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440485550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:37,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:37,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:37,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583702548] [2025-02-07 21:16:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:37,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:37,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:37,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:37,249 INFO L87 Difference]: Start difference. First operand 1359 states and 2036 transitions. Second operand has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (246), 2 states have call predecessors, (246), 1 states have return successors, (245), 1 states have call predecessors, (245), 1 states have call successors, (245) [2025-02-07 21:16:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:37,537 INFO L93 Difference]: Finished difference Result 1365 states and 2041 transitions. [2025-02-07 21:16:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:37,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (246), 2 states have call predecessors, (246), 1 states have return successors, (245), 1 states have call predecessors, (245), 1 states have call successors, (245) Word has length 1677 [2025-02-07 21:16:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:37,550 INFO L225 Difference]: With dead ends: 1365 [2025-02-07 21:16:37,550 INFO L226 Difference]: Without dead ends: 1363 [2025-02-07 21:16:37,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:37,552 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1333 mSDsluCounter, 5968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:37,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 7968 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-02-07 21:16:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2025-02-07 21:16:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 834 states have (on average 1.2134292565947242) internal successors, (1012), 862 states have internal predecessors, (1012), 514 states have call successors, (514), 14 states have call predecessors, (514), 14 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2039 transitions. [2025-02-07 21:16:37,729 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2039 transitions. Word has length 1677 [2025-02-07 21:16:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:37,732 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2039 transitions. [2025-02-07 21:16:37,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (246), 2 states have call predecessors, (246), 1 states have return successors, (245), 1 states have call predecessors, (245), 1 states have call successors, (245) [2025-02-07 21:16:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2039 transitions. [2025-02-07 21:16:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1684 [2025-02-07 21:16:37,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:37,757 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:37,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:16:37,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -627372206, now seen corresponding path program 1 times [2025-02-07 21:16:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833714942] [2025-02-07 21:16:37,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:39,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1683 statements into 1 equivalence classes. [2025-02-07 21:16:39,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1683 of 1683 statements. [2025-02-07 21:16:39,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:39,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 115730 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 115720 trivial. 0 not checked. [2025-02-07 21:16:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833714942] [2025-02-07 21:16:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833714942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:43,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366184587] [2025-02-07 21:16:43,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:43,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:43,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:43,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:43,220 INFO L87 Difference]: Start difference. First operand 1363 states and 2039 transitions. Second operand has 6 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (247), 2 states have call predecessors, (247), 1 states have return successors, (246), 1 states have call predecessors, (246), 1 states have call successors, (246) [2025-02-07 21:16:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:43,481 INFO L93 Difference]: Finished difference Result 1369 states and 2044 transitions. [2025-02-07 21:16:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (247), 2 states have call predecessors, (247), 1 states have return successors, (246), 1 states have call predecessors, (246), 1 states have call successors, (246) Word has length 1683 [2025-02-07 21:16:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:43,494 INFO L225 Difference]: With dead ends: 1369 [2025-02-07 21:16:43,495 INFO L226 Difference]: Without dead ends: 1367 [2025-02-07 21:16:43,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:43,496 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1331 mSDsluCounter, 5968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:43,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 7968 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-02-07 21:16:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2025-02-07 21:16:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 837 states have (on average 1.2126642771804061) internal successors, (1015), 865 states have internal predecessors, (1015), 514 states have call successors, (514), 15 states have call predecessors, (514), 15 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2042 transitions. [2025-02-07 21:16:43,671 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2042 transitions. Word has length 1683 [2025-02-07 21:16:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:43,672 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2042 transitions. [2025-02-07 21:16:43,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (247), 2 states have call predecessors, (247), 1 states have return successors, (246), 1 states have call predecessors, (246), 1 states have call successors, (246) [2025-02-07 21:16:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2042 transitions. [2025-02-07 21:16:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1690 [2025-02-07 21:16:43,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:43,695 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:43,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:16:43,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:43,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash -961971707, now seen corresponding path program 1 times [2025-02-07 21:16:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216216196] [2025-02-07 21:16:43,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:44,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1689 statements into 1 equivalence classes. [2025-02-07 21:16:45,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1689 of 1689 statements. [2025-02-07 21:16:45,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:45,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 115752 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 115740 trivial. 0 not checked. [2025-02-07 21:16:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216216196] [2025-02-07 21:16:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216216196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040901541] [2025-02-07 21:16:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:48,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:48,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:48,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:48,958 INFO L87 Difference]: Start difference. First operand 1367 states and 2042 transitions. Second operand has 6 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 2 states have call successors, (248), 2 states have call predecessors, (248), 1 states have return successors, (247), 1 states have call predecessors, (247), 1 states have call successors, (247) [2025-02-07 21:16:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:49,239 INFO L93 Difference]: Finished difference Result 1373 states and 2047 transitions. [2025-02-07 21:16:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 2 states have call successors, (248), 2 states have call predecessors, (248), 1 states have return successors, (247), 1 states have call predecessors, (247), 1 states have call successors, (247) Word has length 1689 [2025-02-07 21:16:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:49,250 INFO L225 Difference]: With dead ends: 1373 [2025-02-07 21:16:49,250 INFO L226 Difference]: Without dead ends: 1371 [2025-02-07 21:16:49,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:49,251 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 1329 mSDsluCounter, 5968 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:49,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 7968 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-02-07 21:16:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2025-02-07 21:16:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 840 states have (on average 1.2119047619047618) internal successors, (1018), 868 states have internal predecessors, (1018), 514 states have call successors, (514), 16 states have call predecessors, (514), 16 states have return successors, (513), 513 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-07 21:16:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2045 transitions. [2025-02-07 21:16:49,432 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2045 transitions. Word has length 1689 [2025-02-07 21:16:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:49,434 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2045 transitions. [2025-02-07 21:16:49,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 2 states have call successors, (248), 2 states have call predecessors, (248), 1 states have return successors, (247), 1 states have call predecessors, (247), 1 states have call successors, (247) [2025-02-07 21:16:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2045 transitions. [2025-02-07 21:16:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2025-02-07 21:16:49,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:49,458 INFO L218 NwaCegarLoop]: trace histogram [241, 241, 241, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:49,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:16:49,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:49,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1043663226, now seen corresponding path program 1 times [2025-02-07 21:16:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713163501] [2025-02-07 21:16:49,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:50,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1695 statements into 1 equivalence classes. [2025-02-07 21:16:51,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1695 of 1695 statements. [2025-02-07 21:16:51,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:51,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat