./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-1.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_nxt.2.M1-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfe38d632dc9d05bd2dc6fdd28950c1547024966bcab88b0922592f6fd40a86e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:17:08,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:17:08,080 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:17:08,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:17:08,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:17:08,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:17:08,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:17:08,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:17:08,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:17:08,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:17:08,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:17:08,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:17:08,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:17:08,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:17:08,103 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:17:08,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:17:08,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:17:08,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:17:08,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:17:08,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:17:08,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:17:08,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:17:08,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:17:08,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:17:08,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:17:08,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:17:08,106 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 -> bfe38d632dc9d05bd2dc6fdd28950c1547024966bcab88b0922592f6fd40a86e [2025-02-07 21:17:08,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:17:08,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:17:08,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:17:08,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:17:08,291 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:17:08,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-1.c [2025-02-07 21:17:09,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c082ac90c/433deab7a02040f9a104c6235ab11b97/FLAGc5a276bf9 [2025-02-07 21:17:09,721 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:17:09,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_nxt.2.M1-1.c [2025-02-07 21:17:09,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c082ac90c/433deab7a02040f9a104c6235ab11b97/FLAGc5a276bf9 [2025-02-07 21:17:09,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c082ac90c/433deab7a02040f9a104c6235ab11b97 [2025-02-07 21:17:09,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:17:09,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:17:09,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:17:09,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:17:09,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:17:09,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:17:09" (1/1) ... [2025-02-07 21:17:09,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d88b74d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:09, skipping insertion in model container [2025-02-07 21:17:09,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:17:09" (1/1) ... [2025-02-07 21:17:09,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:17:10,104 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_nxt.2.M1-1.c[2020,2033] [2025-02-07 21:17:10,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:17:10,379 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:17:10,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.bug2.i","-S") [47] [2025-02-07 21:17:10,390 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_nxt.2.M1-1.c[2020,2033] [2025-02-07 21:17:10,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:17:10,569 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:17:10,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10 WrapperNode [2025-02-07 21:17:10,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:17:10,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:17:10,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:17:10,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:17:10,575 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:17:10" (1/1) ... [2025-02-07 21:17:10,605 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:17:10" (1/1) ... [2025-02-07 21:17:10,724 INFO L138 Inliner]: procedures = 63, calls = 2139, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 4505 [2025-02-07 21:17:10,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:17:10,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:17:10,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:17:10,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:17:10,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,836 INFO L175 MemorySlicer]: Split 1626 memory accesses to 22 slices as follows [2, 50, 5, 3, 8, 2, 264, 305, 156, 113, 79, 57, 82, 105, 82, 105, 82, 2, 105, 8, 4, 7]. 19 percent of accesses are in the largest equivalence class. The 223 initializations are split as follows [2, 0, 2, 1, 0, 0, 24, 24, 2, 2, 1, 1, 27, 27, 27, 27, 27, 0, 27, 0, 0, 2]. The 257 writes are split as follows [0, 26, 1, 1, 4, 1, 24, 24, 2, 2, 1, 1, 28, 26, 28, 26, 28, 1, 26, 4, 0, 3]. [2025-02-07 21:17:10,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:10,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:11,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:11,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:17:11,030 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:17:11,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:17:11,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:17:11,031 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (1/1) ... [2025-02-07 21:17:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:17:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:17:11,056 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:17:11,061 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:17:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-07 21:17:11,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:17:11,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-07 21:17:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-07 21:17:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-07 21:17:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_observer_obstacle_flag [2025-02-07 21:17:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_observer_obstacle_flag [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-07 21:17:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:17:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-07 21:17:11,091 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-07 21:17:11,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:17:11,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:17:11,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-07 21:17:11,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:17:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:17:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-07 21:17:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_obstacle_flag [2025-02-07 21:17:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_obstacle_flag [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:17:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:17:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-07 21:17:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:17:11,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:17:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-07 21:17:11,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-07 21:17:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-07 21:17:11,095 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-07 21:17:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:17:11,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:17:11,523 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:17:11,525 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:17:11,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2009-1: assume __startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_~or3~2#1 := ~__startrek_round~0; [2025-02-07 21:17:11,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2009-1: assume !__startrek_read_observer_obstacle_flag_#t~switch1335#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1;call __startrek_read_observer_obstacle_flag_#t~mem1339#1 := read~int#16(~#_observer_obstacle_flag_~0.base, ~#_observer_obstacle_flag_~0.offset + (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296), 1);__startrek_read_observer_obstacle_flag_~r1~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~mem1339#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~mem1339#1;__startrek_read_observer_obstacle_flag_#res#1 := (if 0 == __startrek_read_observer_obstacle_flag_~r1~2#1 % 256 then 0 else 1); [2025-02-07 21:17:11,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: 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#17((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#5((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:17:11,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-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:17:11,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: OSEK_Task_ts1_#t~ret42#1 := __startrek_read_observer_obstacle_flag_#res#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1, __startrek_read_observer_obstacle_flag_#t~ret1336#1, __startrek_read_observer_obstacle_flag_#t~ret1337#1, __startrek_read_observer_obstacle_flag_#t~ret1338#1, __startrek_read_observer_obstacle_flag_#t~mem1339#1, __startrek_read_observer_obstacle_flag_~r1~2#1, __startrek_read_observer_obstacle_flag_~c2~2#1, __startrek_read_observer_obstacle_flag_~or3~2#1;assume { :end_inline___startrek_read_observer_obstacle_flag } true;OSEK_Task_ts1_~tmp___3~0#1 := (if 0 == OSEK_Task_ts1_#t~ret42#1 % 256 then 0 else 1); [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: 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:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: call OSEK_Task_ts1_#t~mem50#1 := read~int#5(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset, 1); [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284-1: SUMMARY for call nxt_motor_set_speed(0, OSEK_Task_ts1_#t~mem49#1, 1); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1424-1: assume __startrek_assert_i0_#t~switch1060#1;call write~int#1(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:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1424-1: assume !__startrek_assert_i0_#t~switch1060#1;havoc __startrek_assert_i0_#t~switch1060#1;havoc __startrek_assert_i0_#t~switch1060#1;havoc __startrek_assert_i0_#t~switch1060#1, __startrek_assert_i0_~arg#1;havoc __startrek_assert_i0_#in~arg#1;assume { :end_inline___startrek_assert_i0 } true; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1994: __startrek_read_observer_obstacle_flag_~c2~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~ret1336#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~ret1336#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1994-1: SUMMARY for call __startrek_read_observer_obstacle_flag_#t~ret1336#1 := __startrek_cs_t0(); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: SUMMARY for call __startrek_write_nxtway_gs_mode(2); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1408: 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:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1408: 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:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume { :begin_inline_ecrobot_bt_data_logger } true;ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1 := OSEK_Task_ts1_~cmd_forward~0#1, OSEK_Task_ts1_~cmd_turn~0#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:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: SUMMARY for call nxt_motor_set_speed(1, OSEK_Task_ts1_#t~mem50#1, 1); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: OSEK_Task_ts1_#t~ret45#1 := ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1, ecrobot_get_battery_voltage_~tmp~3#1;assume { :end_inline_ecrobot_get_battery_voltage } true;OSEK_Task_ts1_~tmp___5~0#1 := OSEK_Task_ts1_#t~ret45#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277-1: assume { :begin_inline_ecrobot_get_battery_voltage } true;havoc ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1, ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1;ecrobot_get_battery_voltage_~tmp~3#1 := ecrobot_get_battery_voltage_#t~nondet30#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1;ecrobot_get_battery_voltage_#res#1 := ecrobot_get_battery_voltage_~tmp~3#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: __startrek_read_observer_obstacle_flag_~c2~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~ret1337#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~ret1337#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003-1: SUMMARY for call __startrek_read_observer_obstacle_flag_#t~ret1337#1 := __startrek_cs_t1(); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: OSEK_Task_ts1_~tmp___2~0#1 := (if 0 == OSEK_Task_ts1_#t~ret43#1 % 256 then 0 else 1);havoc OSEK_Task_ts1_#t~ret43#1;assume { :begin_inline___startrek_assert_i0 } true;__startrek_assert_i0_#in~arg#1 := (if 0 == OSEK_Task_ts1_~tmp___2~0#1 % 256 then 0 else 1);havoc __startrek_assert_i0_#t~switch1060#1, __startrek_assert_i0_~arg#1;__startrek_assert_i0_~arg#1 := __startrek_assert_i0_#in~arg#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269-1: SUMMARY for call OSEK_Task_ts1_#t~ret43#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: 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:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012: __startrek_read_observer_obstacle_flag_~c2~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~ret1338#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~ret1338#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012-1: SUMMARY for call __startrek_read_observer_obstacle_flag_#t~ret1338#1 := __startrek_cs_t2(); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: assume -128 <= OSEK_Task_ts1_#t~ret46#1 && OSEK_Task_ts1_#t~ret46#1 <= 127;OSEK_Task_ts1_~tmp___6~0#1 := OSEK_Task_ts1_#t~ret46#1; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278-1: SUMMARY for call OSEK_Task_ts1_#t~ret46#1 := nxt_motor_get_count(1); srcloc: null [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L245: assume { :end_inline_balance_init } true; [2025-02-07 21:17:11,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418-1: assume __startrek_assert_i0_#t~switch1060#1;call write~int#3(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:17:11,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418-1: assume !__startrek_assert_i0_#t~switch1060#1;__startrek_assert_i0_#t~switch1060#1 := __startrek_assert_i0_#t~switch1060#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:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418-2: __startrek_assert_i0_#t~switch1060#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:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: 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:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: 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~mem49#1 := read~int#17(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, 1); [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: assume -128 <= OSEK_Task_ts1_#t~ret47#1 && OSEK_Task_ts1_#t~ret47#1 <= 127;OSEK_Task_ts1_~tmp___7~0#1 := OSEK_Task_ts1_#t~ret47#1; [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: SUMMARY for call OSEK_Task_ts1_#t~ret47#1 := nxt_motor_get_count(0); srcloc: null [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: SUMMARY for call nxt_motor_set_count(0, 0); srcloc: null [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: assume 0 != OSEK_Task_ts1_~tmp___4~0#1 % 256;OSEK_Task_ts1_~cmd_forward~0#1 := -100;OSEK_Task_ts1_~cmd_turn~0#1 := 0; [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: assume !(0 != OSEK_Task_ts1_~tmp___4~0#1 % 256); [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-2: assume 0 != OSEK_Task_ts1_~tmp___3~0#1 % 256; [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-2: assume !(0 != OSEK_Task_ts1_~tmp___3~0#1 % 256); [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: assume 0 != __startrek_assert_i0_~arg#1 % 256; [2025-02-07 21:17:11,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: assume !(0 != __startrek_assert_i0_~arg#1 % 256); [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: OSEK_Task_ts1_~tmp___8~0#1 := OSEK_Task_ts1_#t~ret48#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 := OSEK_Task_ts1_~cmd_forward~0#1, OSEK_Task_ts1_~cmd_turn~0#1, OSEK_Task_ts1_~tmp___8~0#1, ~gyro_offset~0, OSEK_Task_ts1_~tmp___7~0#1, OSEK_Task_ts1_~tmp___6~0#1, OSEK_Task_ts1_~tmp___5~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#19(~ud_theta_ref~0, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, 4);call write~int#19(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 4 + balance_control_~#tmp~0#1.offset, 4);call write~int#19(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#19(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 12 + balance_control_~#tmp~0#1.offset, 4);call write~int#4(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#4(~ud_psi~0, balance_control_~#tmp_theta_0~0#1.base, 4 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#4(~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#4(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#19(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#4(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#20(~#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#19(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#4(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#20(~#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#19(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#4(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#20(~#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#19(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#4(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#20(~#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:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280-1: SUMMARY for call OSEK_Task_ts1_#t~ret48#1 := ecrobot_get_gyro_sensor(3); srcloc: null [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: SUMMARY for call nxt_motor_set_count(1, 0); srcloc: null [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: OSEK_Task_ts1_~tmp___4~0#1 := (if 0 == OSEK_Task_ts1_#t~ret44#1 % 256 then 0 else 1); [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272-1: SUMMARY for call OSEK_Task_ts1_#t~ret44#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: havoc ecrobot_read_bt_packet_#t~nondet28#1, ecrobot_read_bt_packet_#t~nondet29#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;call OSEK_Task_ts1_#t~mem40#1 := read~int#21(~#bt_receive_buf~0.base, ~#bt_receive_buf~0.offset, 1);OSEK_Task_ts1_~cmd_forward~0#1 := (if -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 <= 127 then -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 else -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 - 256);call OSEK_Task_ts1_#t~mem41#1 := read~int#21(~#bt_receive_buf~0.base, 1 + ~#bt_receive_buf~0.offset, 1);OSEK_Task_ts1_~cmd_turn~0#1 := (if OSEK_Task_ts1_#t~mem41#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem41#1 % 256 % 256 else OSEK_Task_ts1_#t~mem41#1 % 256 % 256 - 256);assume { :begin_inline___startrek_read_observer_obstacle_flag } true;havoc __startrek_read_observer_obstacle_flag_#res#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1, __startrek_read_observer_obstacle_flag_#t~ret1336#1, __startrek_read_observer_obstacle_flag_#t~ret1337#1, __startrek_read_observer_obstacle_flag_#t~ret1338#1, __startrek_read_observer_obstacle_flag_#t~mem1339#1, __startrek_read_observer_obstacle_flag_~r1~2#1, __startrek_read_observer_obstacle_flag_~c2~2#1, __startrek_read_observer_obstacle_flag_~or3~2#1;havoc __startrek_read_observer_obstacle_flag_~r1~2#1;havoc __startrek_read_observer_obstacle_flag_~c2~2#1;havoc __startrek_read_observer_obstacle_flag_~or3~2#1;__startrek_read_observer_obstacle_flag_#t~switch1335#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:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: ~cal_start_time~0 := OSEK_Task_ts1_#t~ret36#1; [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L248-1: SUMMARY for call OSEK_Task_ts1_#t~ret36#1 := ecrobot_get_systick_ms(); srcloc: null [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1421-1: assume __startrek_assert_i0_#t~switch1060#1;call write~int#2(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:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1421-1: assume !__startrek_assert_i0_#t~switch1060#1;__startrek_assert_i0_#t~switch1060#1 := __startrek_assert_i0_#t~switch1060#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:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: assume __startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_~or3~2#1 := ~__startrek_round~0; [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: assume !__startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_#t~switch1335#1 := __startrek_read_observer_obstacle_flag_#t~switch1335#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:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: SUMMARY for call __startrek_write_nxtway_gs_mode(1); srcloc: null [2025-02-07 21:17:11,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000-1: assume __startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_~or3~2#1 := ~__startrek_round~0; [2025-02-07 21:17:11,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000-1: assume !__startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_#t~switch1335#1 := __startrek_read_observer_obstacle_flag_#t~switch1335#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:17:11,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: 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:17:11,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: 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:17:11,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: ~__startrek_lock~0 := 0; [2025-02-07 21:17:11,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320-1: SUMMARY for call __startrek_write_observer_obstacle_flag(1); srcloc: null [2025-02-07 21:17:11,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: 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;~__startrek_lock~0 := 1; [2025-02-07 21:17:11,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: 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:17:11,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L317: OSEK_Task_ts2_#t~ret53#1 := ecrobot_get_sonar_sensor_#res#1;havoc ecrobot_get_sonar_sensor_#t~nondet51#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~ret53#1;havoc OSEK_Task_ts2_#t~ret53#1; [2025-02-07 21:17:11,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: SUMMARY for call __startrek_write_obstacle_flag(1); srcloc: null [2025-02-07 21:17:18,066 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-07 21:17:18,066 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:17:18,094 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:17:18,094 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:17:18,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:17:18 BoogieIcfgContainer [2025-02-07 21:17:18,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:17:18,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:17:18,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:17:18,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:17:18,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:17:09" (1/3) ... [2025-02-07 21:17:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d5b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:17:18, skipping insertion in model container [2025-02-07 21:17:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:17:10" (2/3) ... [2025-02-07 21:17:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d5b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:17:18, skipping insertion in model container [2025-02-07 21:17:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:17:18" (3/3) ... [2025-02-07 21:17:18,103 INFO L128 eAbstractionObserver]: Analyzing ICFG rekcba_nxt.2.M1-1.c [2025-02-07 21:17:18,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:17:18,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekcba_nxt.2.M1-1.c that has 19 procedures, 1226 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 21:17:18,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:17:18,195 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;@5a8e9af3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:17:18,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:17:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 745 states have (on average 1.2751677852348993) internal successors, (950), 778 states have internal predecessors, (950), 431 states have call successors, (431), 14 states have call predecessors, (431), 14 states have return successors, (431), 431 states have call predecessors, (431), 431 states have call successors, (431) [2025-02-07 21:17:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2025-02-07 21:17:18,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:18,248 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:18,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:18,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 817382898, now seen corresponding path program 1 times [2025-02-07 21:17:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:18,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67182156] [2025-02-07 21:17:18,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 873 statements into 1 equivalence classes. [2025-02-07 21:17:19,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 873 of 873 statements. [2025-02-07 21:17:19,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:19,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 24420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2025-02-07 21:17:22,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:22,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67182156] [2025-02-07 21:17:22,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67182156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:22,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:22,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623556213] [2025-02-07 21:17:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:22,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:22,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:22,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:22,512 INFO L87 Difference]: Start difference. First operand has 1202 states, 745 states have (on average 1.2751677852348993) internal successors, (950), 778 states have internal predecessors, (950), 431 states have call successors, (431), 14 states have call predecessors, (431), 14 states have return successors, (431), 431 states have call predecessors, (431), 431 states have call successors, (431) Second operand has 6 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (111), 1 states have call predecessors, (111), 1 states have call successors, (111) [2025-02-07 21:17:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:22,937 INFO L93 Difference]: Finished difference Result 2390 states and 4005 transitions. [2025-02-07 21:17:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (111), 1 states have call predecessors, (111), 1 states have call successors, (111) Word has length 873 [2025-02-07 21:17:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:22,967 INFO L225 Difference]: With dead ends: 2390 [2025-02-07 21:17:22,971 INFO L226 Difference]: Without dead ends: 1118 [2025-02-07 21:17:22,987 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:17:22,989 INFO L435 NwaCegarLoop]: 1777 mSDtfsCounter, 1384 mSDsluCounter, 5303 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 7080 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:17:22,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 7080 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:17:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-02-07 21:17:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2025-02-07 21:17:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 697 states have (on average 1.2525107604017216) internal successors, (873), 725 states have internal predecessors, (873), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1694 transitions. [2025-02-07 21:17:23,237 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1694 transitions. Word has length 873 [2025-02-07 21:17:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:23,241 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1694 transitions. [2025-02-07 21:17:23,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (111), 1 states have call predecessors, (111), 1 states have call successors, (111) [2025-02-07 21:17:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1694 transitions. [2025-02-07 21:17:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2025-02-07 21:17:23,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:23,265 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:23,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:17:23,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:23,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1417228875, now seen corresponding path program 1 times [2025-02-07 21:17:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:23,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956709845] [2025-02-07 21:17:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-02-07 21:17:24,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-02-07 21:17:24,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24422 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2025-02-07 21:17:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956709845] [2025-02-07 21:17:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956709845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042953169] [2025-02-07 21:17:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:26,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:26,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:26,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:26,234 INFO L87 Difference]: Start difference. First operand 1118 states and 1694 transitions. Second operand has 6 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-02-07 21:17:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:26,472 INFO L93 Difference]: Finished difference Result 1124 states and 1699 transitions. [2025-02-07 21:17:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 879 [2025-02-07 21:17:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:26,482 INFO L225 Difference]: With dead ends: 1124 [2025-02-07 21:17:26,483 INFO L226 Difference]: Without dead ends: 1122 [2025-02-07 21:17:26,484 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:17:26,485 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1266 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 6636 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:17:26,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-02-07 21:17:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-02-07 21:17:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 700 states have (on average 1.2514285714285713) internal successors, (876), 728 states have internal predecessors, (876), 411 states have call successors, (411), 10 states have call predecessors, (411), 10 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1697 transitions. [2025-02-07 21:17:26,653 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1697 transitions. Word has length 879 [2025-02-07 21:17:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:26,657 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1697 transitions. [2025-02-07 21:17:26,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-02-07 21:17:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1697 transitions. [2025-02-07 21:17:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2025-02-07 21:17:26,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:26,676 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:26,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:17:26,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:26,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1197272806, now seen corresponding path program 1 times [2025-02-07 21:17:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016289597] [2025-02-07 21:17:26,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:26,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 885 statements into 1 equivalence classes. [2025-02-07 21:17:27,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 885 of 885 statements. [2025-02-07 21:17:27,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:27,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 24428 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24424 trivial. 0 not checked. [2025-02-07 21:17:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016289597] [2025-02-07 21:17:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016289597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:28,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:28,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414751101] [2025-02-07 21:17:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:28,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:28,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:28,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:28,886 INFO L87 Difference]: Start difference. First operand 1122 states and 1697 transitions. Second operand has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-07 21:17:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:29,076 INFO L93 Difference]: Finished difference Result 1128 states and 1702 transitions. [2025-02-07 21:17:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:29,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 885 [2025-02-07 21:17:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:29,085 INFO L225 Difference]: With dead ends: 1128 [2025-02-07 21:17:29,085 INFO L226 Difference]: Without dead ends: 1126 [2025-02-07 21:17:29,086 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:17:29,086 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1264 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 6636 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:17:29,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-02-07 21:17:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2025-02-07 21:17:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 703 states have (on average 1.2503556187766713) internal successors, (879), 731 states have internal predecessors, (879), 411 states have call successors, (411), 11 states have call predecessors, (411), 11 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1700 transitions. [2025-02-07 21:17:29,180 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1700 transitions. Word has length 885 [2025-02-07 21:17:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:29,182 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1700 transitions. [2025-02-07 21:17:29,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-07 21:17:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1700 transitions. [2025-02-07 21:17:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-02-07 21:17:29,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:29,191 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:17:29,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:29,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1533198915, now seen corresponding path program 1 times [2025-02-07 21:17:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:29,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350945844] [2025-02-07 21:17:29,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:29,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-02-07 21:17:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-02-07 21:17:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 24438 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24432 trivial. 0 not checked. [2025-02-07 21:17:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350945844] [2025-02-07 21:17:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350945844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495866204] [2025-02-07 21:17:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:31,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:31,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:31,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:31,224 INFO L87 Difference]: Start difference. First operand 1126 states and 1700 transitions. Second operand has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-07 21:17:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:31,446 INFO L93 Difference]: Finished difference Result 1132 states and 1705 transitions. [2025-02-07 21:17:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:31,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 891 [2025-02-07 21:17:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:31,455 INFO L225 Difference]: With dead ends: 1132 [2025-02-07 21:17:31,456 INFO L226 Difference]: Without dead ends: 1130 [2025-02-07 21:17:31,456 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:17:31,457 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1262 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 6636 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:17:31,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-02-07 21:17:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2025-02-07 21:17:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 706 states have (on average 1.2492917847025495) internal successors, (882), 734 states have internal predecessors, (882), 411 states have call successors, (411), 12 states have call predecessors, (411), 12 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1703 transitions. [2025-02-07 21:17:31,592 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1703 transitions. Word has length 891 [2025-02-07 21:17:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:31,594 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1703 transitions. [2025-02-07 21:17:31,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-07 21:17:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1703 transitions. [2025-02-07 21:17:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2025-02-07 21:17:31,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:31,609 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:31,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:17:31,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:31,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1902439710, now seen corresponding path program 1 times [2025-02-07 21:17:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227285873] [2025-02-07 21:17:31,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes. [2025-02-07 21:17:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements. [2025-02-07 21:17:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24452 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24444 trivial. 0 not checked. [2025-02-07 21:17:33,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227285873] [2025-02-07 21:17:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227285873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:33,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:33,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113806490] [2025-02-07 21:17:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:33,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:33,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:33,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:33,698 INFO L87 Difference]: Start difference. First operand 1130 states and 1703 transitions. Second operand has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-07 21:17:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:33,878 INFO L93 Difference]: Finished difference Result 1136 states and 1708 transitions. [2025-02-07 21:17:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 897 [2025-02-07 21:17:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:33,887 INFO L225 Difference]: With dead ends: 1136 [2025-02-07 21:17:33,887 INFO L226 Difference]: Without dead ends: 1134 [2025-02-07 21:17:33,888 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:17:33,889 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1260 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 6636 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:17:33,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-02-07 21:17:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2025-02-07 21:17:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 709 states have (on average 1.2482369534555713) internal successors, (885), 737 states have internal predecessors, (885), 411 states have call successors, (411), 13 states have call predecessors, (411), 13 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1706 transitions. [2025-02-07 21:17:33,981 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1706 transitions. Word has length 897 [2025-02-07 21:17:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:33,982 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1706 transitions. [2025-02-07 21:17:33,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-07 21:17:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1706 transitions. [2025-02-07 21:17:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2025-02-07 21:17:33,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:33,991 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:17:33,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:33,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1104111427, now seen corresponding path program 1 times [2025-02-07 21:17:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67171824] [2025-02-07 21:17:33,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:34,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 903 statements into 1 equivalence classes. [2025-02-07 21:17:34,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 903 of 903 statements. [2025-02-07 21:17:34,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:34,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 24470 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24460 trivial. 0 not checked. [2025-02-07 21:17:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67171824] [2025-02-07 21:17:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67171824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827963344] [2025-02-07 21:17:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:35,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:35,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:35,887 INFO L87 Difference]: Start difference. First operand 1134 states and 1706 transitions. Second operand has 6 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (117), 2 states have call predecessors, (117), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-07 21:17:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:36,057 INFO L93 Difference]: Finished difference Result 1140 states and 1711 transitions. [2025-02-07 21:17:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (117), 2 states have call predecessors, (117), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 903 [2025-02-07 21:17:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:36,064 INFO L225 Difference]: With dead ends: 1140 [2025-02-07 21:17:36,066 INFO L226 Difference]: Without dead ends: 1138 [2025-02-07 21:17:36,066 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:17:36,067 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1258 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 6636 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:17:36,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-07 21:17:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2025-02-07 21:17:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 712 states have (on average 1.247191011235955) internal successors, (888), 740 states have internal predecessors, (888), 411 states have call successors, (411), 14 states have call predecessors, (411), 14 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1709 transitions. [2025-02-07 21:17:36,189 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1709 transitions. Word has length 903 [2025-02-07 21:17:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:36,190 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1709 transitions. [2025-02-07 21:17:36,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (117), 2 states have call predecessors, (117), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-07 21:17:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1709 transitions. [2025-02-07 21:17:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-02-07 21:17:36,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:36,198 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:36,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:17:36,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:36,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1361733094, now seen corresponding path program 1 times [2025-02-07 21:17:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109304205] [2025-02-07 21:17:36,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:36,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-02-07 21:17:36,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-02-07 21:17:36,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:36,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24480 trivial. 0 not checked. [2025-02-07 21:17:38,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:38,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109304205] [2025-02-07 21:17:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109304205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:38,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:38,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027115020] [2025-02-07 21:17:38,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:38,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:38,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:38,211 INFO L87 Difference]: Start difference. First operand 1138 states and 1709 transitions. Second operand has 6 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (117), 1 states have call predecessors, (117), 1 states have call successors, (117) [2025-02-07 21:17:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:38,401 INFO L93 Difference]: Finished difference Result 1144 states and 1714 transitions. [2025-02-07 21:17:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (117), 1 states have call predecessors, (117), 1 states have call successors, (117) Word has length 909 [2025-02-07 21:17:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:38,410 INFO L225 Difference]: With dead ends: 1144 [2025-02-07 21:17:38,410 INFO L226 Difference]: Without dead ends: 1142 [2025-02-07 21:17:38,411 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:17:38,413 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1256 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 6636 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:17:38,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-02-07 21:17:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2025-02-07 21:17:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 715 states have (on average 1.2461538461538462) internal successors, (891), 743 states have internal predecessors, (891), 411 states have call successors, (411), 15 states have call predecessors, (411), 15 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1712 transitions. [2025-02-07 21:17:38,537 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1712 transitions. Word has length 909 [2025-02-07 21:17:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:38,539 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1712 transitions. [2025-02-07 21:17:38,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (117), 1 states have call predecessors, (117), 1 states have call successors, (117) [2025-02-07 21:17:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1712 transitions. [2025-02-07 21:17:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-02-07 21:17:38,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:38,553 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 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] [2025-02-07 21:17:38,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:17:38,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:38,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 249550155, now seen corresponding path program 1 times [2025-02-07 21:17:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871224333] [2025-02-07 21:17:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:38,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-02-07 21:17:39,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-02-07 21:17:39,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:39,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24518 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24504 trivial. 0 not checked. [2025-02-07 21:17:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871224333] [2025-02-07 21:17:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871224333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146695171] [2025-02-07 21:17:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:41,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:41,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:41,138 INFO L87 Difference]: Start difference. First operand 1142 states and 1712 transitions. Second operand has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-07 21:17:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:41,333 INFO L93 Difference]: Finished difference Result 1148 states and 1717 transitions. [2025-02-07 21:17:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:41,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 915 [2025-02-07 21:17:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:41,340 INFO L225 Difference]: With dead ends: 1148 [2025-02-07 21:17:41,340 INFO L226 Difference]: Without dead ends: 1146 [2025-02-07 21:17:41,342 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:17:41,342 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1254 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 6636 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:17:41,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-07 21:17:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-02-07 21:17:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 718 states have (on average 1.2451253481894151) internal successors, (894), 746 states have internal predecessors, (894), 411 states have call successors, (411), 16 states have call predecessors, (411), 16 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1715 transitions. [2025-02-07 21:17:41,446 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1715 transitions. Word has length 915 [2025-02-07 21:17:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:41,447 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1715 transitions. [2025-02-07 21:17:41,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-07 21:17:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1715 transitions. [2025-02-07 21:17:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-02-07 21:17:41,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:41,456 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:41,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:17:41,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:41,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1613456398, now seen corresponding path program 1 times [2025-02-07 21:17:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910894838] [2025-02-07 21:17:41,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:41,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-02-07 21:17:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-02-07 21:17:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 24548 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24532 trivial. 0 not checked. [2025-02-07 21:17:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910894838] [2025-02-07 21:17:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910894838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32007132] [2025-02-07 21:17:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:43,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:43,818 INFO L87 Difference]: Start difference. First operand 1146 states and 1715 transitions. Second operand has 6 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-07 21:17:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:44,012 INFO L93 Difference]: Finished difference Result 1152 states and 1720 transitions. [2025-02-07 21:17:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 921 [2025-02-07 21:17:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:44,025 INFO L225 Difference]: With dead ends: 1152 [2025-02-07 21:17:44,025 INFO L226 Difference]: Without dead ends: 1150 [2025-02-07 21:17:44,026 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:17:44,029 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1252 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 6636 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:17:44,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-02-07 21:17:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2025-02-07 21:17:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 721 states have (on average 1.2441054091539527) internal successors, (897), 749 states have internal predecessors, (897), 411 states have call successors, (411), 17 states have call predecessors, (411), 17 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1718 transitions. [2025-02-07 21:17:44,132 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1718 transitions. Word has length 921 [2025-02-07 21:17:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:44,133 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1718 transitions. [2025-02-07 21:17:44,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-07 21:17:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1718 transitions. [2025-02-07 21:17:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2025-02-07 21:17:44,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:44,141 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:44,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:17:44,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash 977715291, now seen corresponding path program 1 times [2025-02-07 21:17:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564631988] [2025-02-07 21:17:44,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:44,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-02-07 21:17:44,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-02-07 21:17:44,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:44,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24582 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24564 trivial. 0 not checked. [2025-02-07 21:17:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564631988] [2025-02-07 21:17:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564631988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196889766] [2025-02-07 21:17:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:46,703 INFO L87 Difference]: Start difference. First operand 1150 states and 1718 transitions. Second operand has 6 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 2 states have call successors, (121), 2 states have call predecessors, (121), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-02-07 21:17:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:46,887 INFO L93 Difference]: Finished difference Result 1156 states and 1723 transitions. [2025-02-07 21:17:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:46,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 2 states have call successors, (121), 2 states have call predecessors, (121), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 927 [2025-02-07 21:17:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:46,894 INFO L225 Difference]: With dead ends: 1156 [2025-02-07 21:17:46,894 INFO L226 Difference]: Without dead ends: 1154 [2025-02-07 21:17:46,895 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:17:46,895 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1250 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 6636 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:17:46,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-02-07 21:17:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2025-02-07 21:17:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 724 states have (on average 1.2430939226519337) internal successors, (900), 752 states have internal predecessors, (900), 411 states have call successors, (411), 18 states have call predecessors, (411), 18 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1721 transitions. [2025-02-07 21:17:47,001 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1721 transitions. Word has length 927 [2025-02-07 21:17:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:47,002 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1721 transitions. [2025-02-07 21:17:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 2 states have call successors, (121), 2 states have call predecessors, (121), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-02-07 21:17:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1721 transitions. [2025-02-07 21:17:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2025-02-07 21:17:47,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:47,009 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:17:47,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash -965383930, now seen corresponding path program 1 times [2025-02-07 21:17:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:47,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337546176] [2025-02-07 21:17:47,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:47,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 933 statements into 1 equivalence classes. [2025-02-07 21:17:47,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 933 of 933 statements. [2025-02-07 21:17:47,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:47,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 24620 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24600 trivial. 0 not checked. [2025-02-07 21:17:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337546176] [2025-02-07 21:17:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337546176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:49,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198365704] [2025-02-07 21:17:49,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:49,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:49,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:49,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:49,681 INFO L87 Difference]: Start difference. First operand 1154 states and 1721 transitions. Second operand has 6 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (121), 1 states have call predecessors, (121), 1 states have call successors, (121) [2025-02-07 21:17:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:49,940 INFO L93 Difference]: Finished difference Result 1160 states and 1726 transitions. [2025-02-07 21:17:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:49,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (121), 1 states have call predecessors, (121), 1 states have call successors, (121) Word has length 933 [2025-02-07 21:17:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:49,948 INFO L225 Difference]: With dead ends: 1160 [2025-02-07 21:17:49,948 INFO L226 Difference]: Without dead ends: 1158 [2025-02-07 21:17:49,949 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:17:49,949 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1248 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 6636 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:17:49,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-07 21:17:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2025-02-07 21:17:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 727 states have (on average 1.2420907840440165) internal successors, (903), 755 states have internal predecessors, (903), 411 states have call successors, (411), 19 states have call predecessors, (411), 19 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1724 transitions. [2025-02-07 21:17:50,134 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1724 transitions. Word has length 933 [2025-02-07 21:17:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:50,135 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1724 transitions. [2025-02-07 21:17:50,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (121), 1 states have call predecessors, (121), 1 states have call successors, (121) [2025-02-07 21:17:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1724 transitions. [2025-02-07 21:17:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-02-07 21:17:50,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:50,148 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:50,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:17:50,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1632164979, now seen corresponding path program 1 times [2025-02-07 21:17:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:50,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344681374] [2025-02-07 21:17:50,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:50,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-02-07 21:17:50,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-02-07 21:17:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 24662 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 24640 trivial. 0 not checked. [2025-02-07 21:17:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344681374] [2025-02-07 21:17:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344681374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985230970] [2025-02-07 21:17:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:52,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:52,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:52,481 INFO L87 Difference]: Start difference. First operand 1158 states and 1724 transitions. Second operand has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-07 21:17:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:52,678 INFO L93 Difference]: Finished difference Result 1164 states and 1729 transitions. [2025-02-07 21:17:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 939 [2025-02-07 21:17:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:52,685 INFO L225 Difference]: With dead ends: 1164 [2025-02-07 21:17:52,685 INFO L226 Difference]: Without dead ends: 1162 [2025-02-07 21:17:52,686 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:17:52,687 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1246 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 6636 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:17:52,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-07 21:17:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-02-07 21:17:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 730 states have (on average 1.2410958904109588) internal successors, (906), 758 states have internal predecessors, (906), 411 states have call successors, (411), 20 states have call predecessors, (411), 20 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1727 transitions. [2025-02-07 21:17:52,798 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1727 transitions. Word has length 939 [2025-02-07 21:17:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:52,799 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1727 transitions. [2025-02-07 21:17:52,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-07 21:17:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1727 transitions. [2025-02-07 21:17:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2025-02-07 21:17:52,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:52,806 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:52,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:17:52,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:52,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1090158882, now seen corresponding path program 1 times [2025-02-07 21:17:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011797222] [2025-02-07 21:17:52,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:53,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 945 statements into 1 equivalence classes. [2025-02-07 21:17:53,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 945 of 945 statements. [2025-02-07 21:17:53,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:53,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24708 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24684 trivial. 0 not checked. [2025-02-07 21:17:55,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011797222] [2025-02-07 21:17:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011797222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089820332] [2025-02-07 21:17:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:55,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:55,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:55,261 INFO L87 Difference]: Start difference. First operand 1162 states and 1727 transitions. Second operand has 6 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-07 21:17:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:55,462 INFO L93 Difference]: Finished difference Result 1168 states and 1732 transitions. [2025-02-07 21:17:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 945 [2025-02-07 21:17:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:55,469 INFO L225 Difference]: With dead ends: 1168 [2025-02-07 21:17:55,469 INFO L226 Difference]: Without dead ends: 1166 [2025-02-07 21:17:55,470 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:17:55,470 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1244 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 6636 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:17:55,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-02-07 21:17:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2025-02-07 21:17:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 733 states have (on average 1.2401091405184175) internal successors, (909), 761 states have internal predecessors, (909), 411 states have call successors, (411), 21 states have call predecessors, (411), 21 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1730 transitions. [2025-02-07 21:17:55,589 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1730 transitions. Word has length 945 [2025-02-07 21:17:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:55,590 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1730 transitions. [2025-02-07 21:17:55,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-07 21:17:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1730 transitions. [2025-02-07 21:17:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2025-02-07 21:17:55,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:55,598 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:55,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:17:55,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:55,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2075975059, now seen corresponding path program 1 times [2025-02-07 21:17:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419389026] [2025-02-07 21:17:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:55,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes. [2025-02-07 21:17:56,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements. [2025-02-07 21:17:56,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:17:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24758 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24732 trivial. 0 not checked. [2025-02-07 21:17:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:17:58,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419389026] [2025-02-07 21:17:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419389026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:17:58,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:17:58,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:17:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127468386] [2025-02-07 21:17:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:17:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:17:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:17:58,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:17:58,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:17:58,369 INFO L87 Difference]: Start difference. First operand 1166 states and 1730 transitions. Second operand has 6 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-02-07 21:17:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:17:58,579 INFO L93 Difference]: Finished difference Result 1172 states and 1735 transitions. [2025-02-07 21:17:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:17:58,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 951 [2025-02-07 21:17:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:17:58,586 INFO L225 Difference]: With dead ends: 1172 [2025-02-07 21:17:58,586 INFO L226 Difference]: Without dead ends: 1170 [2025-02-07 21:17:58,586 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:17:58,587 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1242 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 6636 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:17:58,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:17:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-02-07 21:17:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2025-02-07 21:17:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 736 states have (on average 1.2391304347826086) internal successors, (912), 764 states have internal predecessors, (912), 411 states have call successors, (411), 22 states have call predecessors, (411), 22 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:17:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1733 transitions. [2025-02-07 21:17:58,711 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1733 transitions. Word has length 951 [2025-02-07 21:17:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:17:58,712 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1733 transitions. [2025-02-07 21:17:58,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-02-07 21:17:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1733 transitions. [2025-02-07 21:17:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2025-02-07 21:17:58,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:17:58,720 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:58,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:17:58,720 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:17:58,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:17:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash 811833414, now seen corresponding path program 1 times [2025-02-07 21:17:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:17:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274958049] [2025-02-07 21:17:58,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:17:58,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:17:58,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 957 statements into 1 equivalence classes. [2025-02-07 21:17:59,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 957 of 957 statements. [2025-02-07 21:17:59,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:17:59,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24812 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 24784 trivial. 0 not checked. [2025-02-07 21:18:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274958049] [2025-02-07 21:18:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274958049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:01,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:01,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671580955] [2025-02-07 21:18:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:01,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:01,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:01,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:01,300 INFO L87 Difference]: Start difference. First operand 1170 states and 1733 transitions. Second operand has 6 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-07 21:18:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:01,615 INFO L93 Difference]: Finished difference Result 1176 states and 1738 transitions. [2025-02-07 21:18:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 957 [2025-02-07 21:18:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:01,625 INFO L225 Difference]: With dead ends: 1176 [2025-02-07 21:18:01,628 INFO L226 Difference]: Without dead ends: 1174 [2025-02-07 21:18:01,629 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:18:01,629 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1240 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 6636 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:18:01,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:18:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-07 21:18:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2025-02-07 21:18:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 739 states have (on average 1.2381596752368065) internal successors, (915), 767 states have internal predecessors, (915), 411 states have call successors, (411), 23 states have call predecessors, (411), 23 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1736 transitions. [2025-02-07 21:18:01,795 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1736 transitions. Word has length 957 [2025-02-07 21:18:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:01,795 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1736 transitions. [2025-02-07 21:18:01,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-07 21:18:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1736 transitions. [2025-02-07 21:18:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-02-07 21:18:01,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:01,803 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:01,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:18:01,803 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:01,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1861519429, now seen corresponding path program 1 times [2025-02-07 21:18:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:01,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313267384] [2025-02-07 21:18:01,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:02,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-02-07 21:18:02,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-02-07 21:18:02,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:02,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 24870 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24840 trivial. 0 not checked. [2025-02-07 21:18:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313267384] [2025-02-07 21:18:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313267384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169454424] [2025-02-07 21:18:04,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:04,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:04,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:04,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:04,460 INFO L87 Difference]: Start difference. First operand 1174 states and 1736 transitions. Second operand has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 2 states have call successors, (127), 2 states have call predecessors, (127), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-07 21:18:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:04,672 INFO L93 Difference]: Finished difference Result 1180 states and 1741 transitions. [2025-02-07 21:18:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 2 states have call successors, (127), 2 states have call predecessors, (127), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 963 [2025-02-07 21:18:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:04,678 INFO L225 Difference]: With dead ends: 1180 [2025-02-07 21:18:04,678 INFO L226 Difference]: Without dead ends: 1178 [2025-02-07 21:18:04,678 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:18:04,679 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1238 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 6636 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:18:04,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-02-07 21:18:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2025-02-07 21:18:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 742 states have (on average 1.2371967654986522) internal successors, (918), 770 states have internal predecessors, (918), 411 states have call successors, (411), 24 states have call predecessors, (411), 24 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1739 transitions. [2025-02-07 21:18:04,809 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1739 transitions. Word has length 963 [2025-02-07 21:18:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:04,809 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1739 transitions. [2025-02-07 21:18:04,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 2 states have call successors, (127), 2 states have call predecessors, (127), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-07 21:18:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1739 transitions. [2025-02-07 21:18:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2025-02-07 21:18:04,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:04,817 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:04,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 21:18:04,817 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:04,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1338139250, now seen corresponding path program 1 times [2025-02-07 21:18:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:04,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811551696] [2025-02-07 21:18:04,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:05,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 969 statements into 1 equivalence classes. [2025-02-07 21:18:05,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 969 of 969 statements. [2025-02-07 21:18:05,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:05,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 24932 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24900 trivial. 0 not checked. [2025-02-07 21:18:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811551696] [2025-02-07 21:18:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811551696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943309895] [2025-02-07 21:18:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:07,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:07,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:07,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:07,573 INFO L87 Difference]: Start difference. First operand 1178 states and 1739 transitions. Second operand has 6 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (127), 1 states have call predecessors, (127), 1 states have call successors, (127) [2025-02-07 21:18:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:07,837 INFO L93 Difference]: Finished difference Result 1184 states and 1744 transitions. [2025-02-07 21:18:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:07,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (127), 1 states have call predecessors, (127), 1 states have call successors, (127) Word has length 969 [2025-02-07 21:18:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:07,843 INFO L225 Difference]: With dead ends: 1184 [2025-02-07 21:18:07,843 INFO L226 Difference]: Without dead ends: 1182 [2025-02-07 21:18:07,843 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:18:07,844 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1236 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 6636 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:18:07,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-02-07 21:18:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2025-02-07 21:18:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 745 states have (on average 1.236241610738255) internal successors, (921), 773 states have internal predecessors, (921), 411 states have call successors, (411), 25 states have call predecessors, (411), 25 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1742 transitions. [2025-02-07 21:18:07,971 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1742 transitions. Word has length 969 [2025-02-07 21:18:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:07,974 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1742 transitions. [2025-02-07 21:18:07,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (127), 1 states have call predecessors, (127), 1 states have call successors, (127) [2025-02-07 21:18:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1742 transitions. [2025-02-07 21:18:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2025-02-07 21:18:07,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:07,981 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:07,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:18:07,982 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash -315662613, now seen corresponding path program 1 times [2025-02-07 21:18:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687015614] [2025-02-07 21:18:07,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:08,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 975 statements into 1 equivalence classes. [2025-02-07 21:18:08,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 975 of 975 statements. [2025-02-07 21:18:08,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24998 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24964 trivial. 0 not checked. [2025-02-07 21:18:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687015614] [2025-02-07 21:18:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687015614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:10,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553910737] [2025-02-07 21:18:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:10,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:10,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:10,766 INFO L87 Difference]: Start difference. First operand 1182 states and 1742 transitions. Second operand has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-02-07 21:18:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:11,092 INFO L93 Difference]: Finished difference Result 1188 states and 1747 transitions. [2025-02-07 21:18:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:11,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 975 [2025-02-07 21:18:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:11,099 INFO L225 Difference]: With dead ends: 1188 [2025-02-07 21:18:11,099 INFO L226 Difference]: Without dead ends: 1186 [2025-02-07 21:18:11,099 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:18:11,100 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1234 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 6636 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:18:11,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-02-07 21:18:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2025-02-07 21:18:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 748 states have (on average 1.2352941176470589) internal successors, (924), 776 states have internal predecessors, (924), 411 states have call successors, (411), 26 states have call predecessors, (411), 26 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1745 transitions. [2025-02-07 21:18:11,346 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1745 transitions. Word has length 975 [2025-02-07 21:18:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1745 transitions. [2025-02-07 21:18:11,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-02-07 21:18:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1745 transitions. [2025-02-07 21:18:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2025-02-07 21:18:11,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:11,360 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 21:18:11,360 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1765446566, now seen corresponding path program 1 times [2025-02-07 21:18:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827941963] [2025-02-07 21:18:11,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:11,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 981 statements into 1 equivalence classes. [2025-02-07 21:18:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 981 of 981 statements. [2025-02-07 21:18:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25068 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 25032 trivial. 0 not checked. [2025-02-07 21:18:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827941963] [2025-02-07 21:18:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827941963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44182998] [2025-02-07 21:18:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:14,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:14,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:14,190 INFO L87 Difference]: Start difference. First operand 1186 states and 1745 transitions. Second operand has 6 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 2 states have call successors, (130), 2 states have call predecessors, (130), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-02-07 21:18:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:14,454 INFO L93 Difference]: Finished difference Result 1192 states and 1750 transitions. [2025-02-07 21:18:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 2 states have call successors, (130), 2 states have call predecessors, (130), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 981 [2025-02-07 21:18:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:14,460 INFO L225 Difference]: With dead ends: 1192 [2025-02-07 21:18:14,463 INFO L226 Difference]: Without dead ends: 1190 [2025-02-07 21:18:14,464 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:18:14,464 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1232 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 6636 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:18:14,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2025-02-07 21:18:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2025-02-07 21:18:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 751 states have (on average 1.2343541944074568) internal successors, (927), 779 states have internal predecessors, (927), 411 states have call successors, (411), 27 states have call predecessors, (411), 27 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1748 transitions. [2025-02-07 21:18:14,602 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1748 transitions. Word has length 981 [2025-02-07 21:18:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:14,604 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1748 transitions. [2025-02-07 21:18:14,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 2 states have call successors, (130), 2 states have call predecessors, (130), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-02-07 21:18:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1748 transitions. [2025-02-07 21:18:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2025-02-07 21:18:14,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:14,633 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 21:18:14,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -709540061, now seen corresponding path program 1 times [2025-02-07 21:18:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848005994] [2025-02-07 21:18:14,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:14,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-02-07 21:18:15,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-02-07 21:18:15,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:15,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25142 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 25104 trivial. 0 not checked. [2025-02-07 21:18:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848005994] [2025-02-07 21:18:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848005994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894459741] [2025-02-07 21:18:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:17,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:17,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:17,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:17,746 INFO L87 Difference]: Start difference. First operand 1190 states and 1748 transitions. Second operand has 6 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (130), 1 states have call predecessors, (130), 1 states have call successors, (130) [2025-02-07 21:18:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:18,024 INFO L93 Difference]: Finished difference Result 1196 states and 1753 transitions. [2025-02-07 21:18:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:18,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (130), 1 states have call predecessors, (130), 1 states have call successors, (130) Word has length 987 [2025-02-07 21:18:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:18,040 INFO L225 Difference]: With dead ends: 1196 [2025-02-07 21:18:18,047 INFO L226 Difference]: Without dead ends: 1194 [2025-02-07 21:18:18,048 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:18:18,048 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1230 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 6636 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:18:18,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-02-07 21:18:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2025-02-07 21:18:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 754 states have (on average 1.23342175066313) internal successors, (930), 782 states have internal predecessors, (930), 411 states have call successors, (411), 28 states have call predecessors, (411), 28 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1751 transitions. [2025-02-07 21:18:18,219 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1751 transitions. Word has length 987 [2025-02-07 21:18:18,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:18,220 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1751 transitions. [2025-02-07 21:18:18,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (130), 1 states have call predecessors, (130), 1 states have call successors, (130) [2025-02-07 21:18:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1751 transitions. [2025-02-07 21:18:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2025-02-07 21:18:18,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:18,227 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:18,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 21:18:18,227 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:18,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1258414050, now seen corresponding path program 1 times [2025-02-07 21:18:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71446891] [2025-02-07 21:18:18,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 993 statements into 1 equivalence classes. [2025-02-07 21:18:18,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 993 of 993 statements. [2025-02-07 21:18:18,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:18,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 25180 trivial. 0 not checked. [2025-02-07 21:18:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71446891] [2025-02-07 21:18:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71446891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:21,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561561526] [2025-02-07 21:18:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:21,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:21,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:21,196 INFO L87 Difference]: Start difference. First operand 1194 states and 1751 transitions. Second operand has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 2 states have call successors, (132), 2 states have call predecessors, (132), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-02-07 21:18:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:21,434 INFO L93 Difference]: Finished difference Result 1200 states and 1756 transitions. [2025-02-07 21:18:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 2 states have call successors, (132), 2 states have call predecessors, (132), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 993 [2025-02-07 21:18:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:21,448 INFO L225 Difference]: With dead ends: 1200 [2025-02-07 21:18:21,451 INFO L226 Difference]: Without dead ends: 1198 [2025-02-07 21:18:21,455 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:18:21,456 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1228 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 6636 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:18:21,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-02-07 21:18:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-02-07 21:18:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 757 states have (on average 1.2324966974900924) internal successors, (933), 785 states have internal predecessors, (933), 411 states have call successors, (411), 29 states have call predecessors, (411), 29 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1754 transitions. [2025-02-07 21:18:21,763 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1754 transitions. Word has length 993 [2025-02-07 21:18:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1754 transitions. [2025-02-07 21:18:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 2 states have call successors, (132), 2 states have call predecessors, (132), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-02-07 21:18:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1754 transitions. [2025-02-07 21:18:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2025-02-07 21:18:21,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:21,780 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:21,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 21:18:21,781 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:21,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1094982557, now seen corresponding path program 1 times [2025-02-07 21:18:21,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:21,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6271851] [2025-02-07 21:18:21,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:21,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:22,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 999 statements into 1 equivalence classes. [2025-02-07 21:18:22,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 999 of 999 statements. [2025-02-07 21:18:22,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:22,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25302 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25260 trivial. 0 not checked. [2025-02-07 21:18:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6271851] [2025-02-07 21:18:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6271851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261783832] [2025-02-07 21:18:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:24,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:24,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:24,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:24,862 INFO L87 Difference]: Start difference. First operand 1198 states and 1754 transitions. Second operand has 6 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 2 states have call successors, (133), 2 states have call predecessors, (133), 1 states have return successors, (132), 1 states have call predecessors, (132), 1 states have call successors, (132) [2025-02-07 21:18:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:25,141 INFO L93 Difference]: Finished difference Result 1204 states and 1759 transitions. [2025-02-07 21:18:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:25,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 2 states have call successors, (133), 2 states have call predecessors, (133), 1 states have return successors, (132), 1 states have call predecessors, (132), 1 states have call successors, (132) Word has length 999 [2025-02-07 21:18:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:25,150 INFO L225 Difference]: With dead ends: 1204 [2025-02-07 21:18:25,150 INFO L226 Difference]: Without dead ends: 1202 [2025-02-07 21:18:25,151 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:18:25,155 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1226 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 6636 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:18:25,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-02-07 21:18:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1202. [2025-02-07 21:18:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 760 states have (on average 1.231578947368421) internal successors, (936), 788 states have internal predecessors, (936), 411 states have call successors, (411), 30 states have call predecessors, (411), 30 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1757 transitions. [2025-02-07 21:18:25,308 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1757 transitions. Word has length 999 [2025-02-07 21:18:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:25,309 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1757 transitions. [2025-02-07 21:18:25,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 2 states have call successors, (133), 2 states have call predecessors, (133), 1 states have return successors, (132), 1 states have call predecessors, (132), 1 states have call successors, (132) [2025-02-07 21:18:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1757 transitions. [2025-02-07 21:18:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2025-02-07 21:18:25,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:25,316 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 21:18:25,316 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:25,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1012923174, now seen corresponding path program 1 times [2025-02-07 21:18:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:25,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60243962] [2025-02-07 21:18:25,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:25,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1005 statements into 1 equivalence classes. [2025-02-07 21:18:25,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1005 of 1005 statements. [2025-02-07 21:18:25,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:25,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25388 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 25344 trivial. 0 not checked. [2025-02-07 21:18:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60243962] [2025-02-07 21:18:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60243962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:28,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130712558] [2025-02-07 21:18:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:28,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:28,611 INFO L87 Difference]: Start difference. First operand 1202 states and 1757 transitions. Second operand has 6 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (133), 1 states have call predecessors, (133), 1 states have call successors, (133) [2025-02-07 21:18:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:28,848 INFO L93 Difference]: Finished difference Result 1208 states and 1762 transitions. [2025-02-07 21:18:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (133), 1 states have call predecessors, (133), 1 states have call successors, (133) Word has length 1005 [2025-02-07 21:18:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:28,852 INFO L225 Difference]: With dead ends: 1208 [2025-02-07 21:18:28,852 INFO L226 Difference]: Without dead ends: 1206 [2025-02-07 21:18:28,853 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:18:28,853 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1224 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 6636 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:18:28,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-02-07 21:18:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2025-02-07 21:18:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 763 states have (on average 1.2306684141546527) internal successors, (939), 791 states have internal predecessors, (939), 411 states have call successors, (411), 31 states have call predecessors, (411), 31 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1760 transitions. [2025-02-07 21:18:29,010 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1760 transitions. Word has length 1005 [2025-02-07 21:18:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:29,011 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1760 transitions. [2025-02-07 21:18:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (133), 1 states have call predecessors, (133), 1 states have call successors, (133) [2025-02-07 21:18:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1760 transitions. [2025-02-07 21:18:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2025-02-07 21:18:29,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:29,018 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 21:18:29,018 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:29,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash -791893, now seen corresponding path program 1 times [2025-02-07 21:18:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517833287] [2025-02-07 21:18:29,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:29,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1011 statements into 1 equivalence classes. [2025-02-07 21:18:29,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1011 of 1011 statements. [2025-02-07 21:18:29,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:29,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25478 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 25432 trivial. 0 not checked. [2025-02-07 21:18:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517833287] [2025-02-07 21:18:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517833287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595623077] [2025-02-07 21:18:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:32,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:32,368 INFO L87 Difference]: Start difference. First operand 1206 states and 1760 transitions. Second operand has 6 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 2 states have call successors, (135), 2 states have call predecessors, (135), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-02-07 21:18:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:32,655 INFO L93 Difference]: Finished difference Result 1212 states and 1765 transitions. [2025-02-07 21:18:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 2 states have call successors, (135), 2 states have call predecessors, (135), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 1011 [2025-02-07 21:18:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:32,660 INFO L225 Difference]: With dead ends: 1212 [2025-02-07 21:18:32,660 INFO L226 Difference]: Without dead ends: 1210 [2025-02-07 21:18:32,661 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:18:32,661 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1222 mSDsluCounter, 4968 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 6635 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:32,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 6635 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-02-07 21:18:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2025-02-07 21:18:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 766 states have (on average 1.2297650130548303) internal successors, (942), 794 states have internal predecessors, (942), 411 states have call successors, (411), 32 states have call predecessors, (411), 32 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1763 transitions. [2025-02-07 21:18:32,820 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1763 transitions. Word has length 1011 [2025-02-07 21:18:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:32,821 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1763 transitions. [2025-02-07 21:18:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 2 states have call successors, (135), 2 states have call predecessors, (135), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-02-07 21:18:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1763 transitions. [2025-02-07 21:18:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2025-02-07 21:18:32,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:32,827 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:32,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 21:18:32,828 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:32,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -223438478, now seen corresponding path program 1 times [2025-02-07 21:18:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911144347] [2025-02-07 21:18:32,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:33,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-02-07 21:18:33,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-02-07 21:18:33,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:33,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat