./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekcba_aso.2.M1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekcba_aso.2.M1-2.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 fe3c2276a7cb4a5d1230bb06af9c590640e6d7fcc357e815e8e5e988ba323a74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:15:34,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:15:34,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:15:34,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:15:34,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:15:34,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:15:34,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:15:34,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:15:34,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:15:34,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:15:34,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:15:34,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:15:34,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:15:34,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:15:34,410 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:15:34,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:15:34,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:15:34,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:15:34,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:15:34,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:15:34,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:15:34,413 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 -> fe3c2276a7cb4a5d1230bb06af9c590640e6d7fcc357e815e8e5e988ba323a74 [2025-02-07 21:15:34,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:15:34,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:15:34,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:15:34,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:15:34,680 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:15:34,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekcba_aso.2.M1-2.c [2025-02-07 21:15:35,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a9dca6e1/0c67533b5c16485784a9068ca1951271/FLAG010007a9f [2025-02-07 21:15:36,123 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:15:36,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_aso.2.M1-2.c [2025-02-07 21:15:36,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a9dca6e1/0c67533b5c16485784a9068ca1951271/FLAG010007a9f [2025-02-07 21:15:36,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a9dca6e1/0c67533b5c16485784a9068ca1951271 [2025-02-07 21:15:36,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:15:36,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:15:36,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:15:36,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:15:36,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:15:36,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:15:36" (1/1) ... [2025-02-07 21:15:36,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e025fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:36, skipping insertion in model container [2025-02-07 21:15:36,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:15:36" (1/1) ... [2025-02-07 21:15:36,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:15:36,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_aso.2.M1-2.c[2320,2333] [2025-02-07 21:15:36,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:15:36,834 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:15:36,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/aso.bug2.i","-S") [53] [2025-02-07 21:15:36,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_aso.2.M1-2.c[2320,2333] [2025-02-07 21:15:37,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:15:37,061 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:15:37,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37 WrapperNode [2025-02-07 21:15:37,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:15:37,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:15:37,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:15:37,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:15:37,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,253 INFO L138 Inliner]: procedures = 64, calls = 2411, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 4955 [2025-02-07 21:15:37,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:15:37,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:15:37,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:15:37,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:15:37,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,400 INFO L175 MemorySlicer]: Split 1843 memory accesses to 27 slices as follows [8, 4, 2, 50, 5, 3, 50, 5, 3, 264, 292, 158, 2, 7, 112, 63, 2, 57, 82, 105, 82, 105, 82, 105, 82, 105, 8]. 16 percent of accesses are in the largest equivalence class. The 280 initializations are split as follows [0, 0, 2, 0, 2, 1, 0, 2, 1, 24, 24, 2, 0, 2, 2, 1, 0, 1, 27, 27, 27, 27, 27, 27, 27, 27, 0]. The 339 writes are split as follows [4, 0, 0, 26, 1, 1, 26, 1, 1, 24, 24, 2, 1, 3, 2, 1, 1, 1, 28, 26, 28, 26, 28, 26, 28, 26, 4]. [2025-02-07 21:15:37,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:15:37,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:15:37,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:15:37,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:15:37,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (1/1) ... [2025-02-07 21:15:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:15:37,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:15:37,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:15:37,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:15:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:15:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_cmd_forward [2025-02-07 21:15:37,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_cmd_forward [2025-02-07 21:15:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-07 21:15:37,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-07 21:15:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:15:37,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:15:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-07 21:15:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-07 21:15:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-07 21:15:37,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-07 21:15:37,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-07 21:15:37,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:15:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-07 21:15:37,647 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-07 21:15:37,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-07 21:15:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_cmd_turn [2025-02-07 21:15:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_cmd_turn [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:15:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:15:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts3 [2025-02-07 21:15:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts3 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-07 21:15:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:15:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-07 21:15:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_cmd_forward [2025-02-07 21:15:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_cmd_forward [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_obstacle_flag [2025-02-07 21:15:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_obstacle_flag [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:15:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:15:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:15:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:15:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:15:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:15:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-07 21:15:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-07 21:15:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:15:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:15:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_cmd_turn [2025-02-07 21:15:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_cmd_turn [2025-02-07 21:15:38,032 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:15:38,034 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L287: assume -128 <= OSEK_Task_ts1_#t~ret45#1 && OSEK_Task_ts1_#t~ret45#1 <= 127;OSEK_Task_ts1_~tmp___10~0#1 := OSEK_Task_ts1_#t~ret45#1; [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L287-1: SUMMARY for call OSEK_Task_ts1_#t~ret45#1 := __startrek_read_cmd_turn(); srcloc: null [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: OSEK_Task_ts1_#t~ret41#1 := ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet29#1, ecrobot_get_battery_voltage_~tmp~3#1;assume { :end_inline_ecrobot_get_battery_voltage } true;OSEK_Task_ts1_~tmp___6~0#1 := OSEK_Task_ts1_#t~ret41#1; [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L250: SUMMARY for call nxt_motor_set_count(0, 0); srcloc: null [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc ecrobot_sound_tone_~arg0#1, ecrobot_sound_tone_~arg1#1, ecrobot_sound_tone_~arg2#1;havoc ecrobot_sound_tone_#in~arg0#1, ecrobot_sound_tone_#in~arg1#1, ecrobot_sound_tone_#in~arg2#1;assume { :end_inline_ecrobot_sound_tone } true; [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L292: call OSEK_Task_ts1_#t~mem48#1 := read~int#16(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset, 1); [2025-02-07 21:15:38,318 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L292-1: SUMMARY for call nxt_motor_set_speed(0, OSEK_Task_ts1_#t~mem47#1, 1); srcloc: null [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L288: assume -128 <= OSEK_Task_ts1_#t~ret46#1 && OSEK_Task_ts1_#t~ret46#1 <= 127;OSEK_Task_ts1_~tmp___11~0#1 := OSEK_Task_ts1_#t~ret46#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_~tmp___11~0#1, OSEK_Task_ts1_~tmp___10~0#1, OSEK_Task_ts1_~tmp___9~0#1, ~gyro_offset~0, OSEK_Task_ts1_~tmp___8~0#1, OSEK_Task_ts1_~tmp___7~0#1, OSEK_Task_ts1_~tmp___6~0#1, OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;balance_control_~args_cmd_forward#1 := balance_control_#in~args_cmd_forward#1;balance_control_~args_cmd_turn#1 := balance_control_#in~args_cmd_turn#1;balance_control_~args_gyro#1 := balance_control_#in~args_gyro#1;balance_control_~args_gyro_offset#1 := balance_control_#in~args_gyro_offset#1;balance_control_~args_theta_m_l#1 := balance_control_#in~args_theta_m_l#1;balance_control_~args_theta_m_r#1 := balance_control_#in~args_theta_m_r#1;balance_control_~args_battery#1 := balance_control_#in~args_battery#1;balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset := balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset;balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset := balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;havoc balance_control_~tmp_theta~0#1;havoc balance_control_~tmp_theta_lpf~0#1;havoc balance_control_~tmp_pwm_r_limiter~0#1;havoc balance_control_~tmp_psidot~0#1;havoc balance_control_~tmp_pwm_turn~0#1;havoc balance_control_~tmp_pwm_l_limiter~0#1;havoc balance_control_~tmp_thetadot_cmd_lpf~0#1;call balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset := #Ultimate.allocOnStack(16);call balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset := #Ultimate.allocOnStack(16);havoc balance_control_~tmp_0~0#1;havoc balance_control_~tmp___0~0#1;havoc balance_control_~tmp___1~0#1;balance_control_~tmp_thetadot_cmd_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_forward#1), 100.0), ~convertUINTToFLOAT(~K_THETADOT~0)), ~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_R~0))), ~convertUINTToFLOAT(~A_R~0 * ~ud_thetadot_cmd_lpf~0)));balance_control_~tmp_theta~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_l#1)), ~convertUINTToFLOAT(~ud_psi~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_r#1)), ~convertUINTToFLOAT(~ud_psi~0))), 0.5));balance_control_~tmp_theta_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_D~0)), ~convertUINTToFLOAT(balance_control_~tmp_theta~0#1)), ~convertUINTToFLOAT(~A_D~0 * ~ud_theta_lpf~0)));balance_control_~tmp_psidot~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_gyro#1 - balance_control_~args_gyro_offset#1), 0.01745329238));call write~int#26(~ud_theta_ref~0, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, 4);call write~int#26(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 4 + balance_control_~#tmp~0#1.offset, 4);call write~int#26(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#26(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 12 + balance_control_~#tmp~0#1.offset, 4);call write~int#0(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#0(~ud_psi~0, balance_control_~#tmp_theta_0~0#1.base, 4 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#0(~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#0(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#26(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#0(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#1(~#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#26(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#0(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#1(~#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#26(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#0(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#1(~#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#26(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#0(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#1(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem16#1 - balance_control_#t~mem17#1) * balance_control_#t~mem18#1;havoc balance_control_#t~mem16#1;havoc balance_control_#t~mem17#1;havoc balance_control_#t~mem18#1;balance_control_#t~post19#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post19#1;havoc balance_control_#t~post19#1; [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L288-1: SUMMARY for call OSEK_Task_ts1_#t~ret46#1 := __startrek_read_cmd_forward(); srcloc: null [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume -128 <= OSEK_Task_ts1_#t~ret42#1 && OSEK_Task_ts1_#t~ret42#1 <= 127;OSEK_Task_ts1_~tmp___7~0#1 := OSEK_Task_ts1_#t~ret42#1; [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284-1: SUMMARY for call OSEK_Task_ts1_#t~ret42#1 := nxt_motor_get_count(1); srcloc: null [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L251: SUMMARY for call nxt_motor_set_count(1, 0); srcloc: null [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: SUMMARY for call __startrek_write_nxtway_gs_mode(2); srcloc: null [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: SUMMARY for call nxt_motor_set_speed(1, OSEK_Task_ts1_#t~mem48#1, 1); srcloc: null [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: 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~mem47#1 := read~int#12(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, 1); [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume -128 <= OSEK_Task_ts1_#t~ret43#1 && OSEK_Task_ts1_#t~ret43#1 <= 127;OSEK_Task_ts1_~tmp___8~0#1 := OSEK_Task_ts1_#t~ret43#1; [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: 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#12((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#16((if balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, 1);balance_control_~tmp_pwm_l_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_thetadot_cmd_lpf~0#1)), ~convertUINTToFLOAT(~ud_theta_ref~0)));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_psidot~0#1)), ~convertUINTToFLOAT(~ud_psi~0)));balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(~ud_theta_ref~0 - balance_control_~tmp_theta~0#1), 0.00400000019), ~convertUINTToFLOAT(~ud_err_theta~0)));~ud_err_theta~0 := balance_control_~tmp_pwm_r_limiter~0#1;~ud_theta_ref~0 := balance_control_~tmp_pwm_l_limiter~0#1;~ud_thetadot_cmd_lpf~0 := balance_control_~tmp_thetadot_cmd_lpf~0#1;~ud_psi~0 := balance_control_~tmp_pwm_turn~0#1;~ud_theta_lpf~0 := balance_control_~tmp_theta_lpf~0#1;call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-02-07 21:15:38,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: SUMMARY for call OSEK_Task_ts1_#t~ret43#1 := nxt_motor_get_count(0); srcloc: null [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: ~cal_start_time~0 := OSEK_Task_ts1_#t~ret34#1; [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L124-1: SUMMARY for call assume_abort_if_not((if 0 != (~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296 then 1 else 0)); srcloc: null [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252-1: SUMMARY for call OSEK_Task_ts1_#t~ret34#1 := ecrobot_get_systick_ms(); srcloc: null [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: OSEK_Task_ts1_~tmp___9~0#1 := OSEK_Task_ts1_#t~ret44#1; [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286-1: SUMMARY for call OSEK_Task_ts1_#t~ret44#1 := ecrobot_get_gyro_sensor(3); srcloc: null [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L253: SUMMARY for call __startrek_write_nxtway_gs_mode(1); srcloc: null [2025-02-07 21:15:38,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: assume { :end_inline_balance_init } true; [2025-02-07 21:15:38,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: OSEK_Task_ts2_#t~ret51#1 := ecrobot_get_sonar_sensor_#res#1;havoc ecrobot_get_sonar_sensor_#t~nondet49#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~ret51#1;havoc OSEK_Task_ts2_#t~ret51#1; [2025-02-07 21:15:38,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: ~__startrek_lock~0 := 0; [2025-02-07 21:15:38,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326-1: SUMMARY for call __startrek_write_cmd_turn(0); srcloc: null [2025-02-07 21:15:38,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: SUMMARY for call __startrek_write_cmd_forward(-100); srcloc: null [2025-02-07 21:15:38,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: SUMMARY for call __startrek_write_obstacle_flag(1); srcloc: null [2025-02-07 21:15:38,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: 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:15:38,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume !((if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25); [2025-02-07 21:15:38,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: assume -128 <= OSEK_Task_ts3_#t~ret60#1 && OSEK_Task_ts3_#t~ret60#1 <= 127;OSEK_Task_ts3_~tmp___4~1#1 := OSEK_Task_ts3_#t~ret60#1;havoc OSEK_Task_ts3_#t~ret60#1;assume { :begin_inline_ecrobot_bt_data_logger } true;ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1 := OSEK_Task_ts3_~tmp___4~1#1, OSEK_Task_ts3_~tmp___3~1#1;havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;ecrobot_bt_data_logger_~arg0#1 := ecrobot_bt_data_logger_#in~arg0#1;ecrobot_bt_data_logger_~arg1#1 := ecrobot_bt_data_logger_#in~arg1#1; [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374-1: SUMMARY for call OSEK_Task_ts3_#t~ret60#1 := __startrek_read_cmd_forward(); srcloc: null [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1518: assume 0 != __startrek_assert_i1_~arg#1 % 256; [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1518: assume !(0 != __startrek_assert_i1_~arg#1 % 256); [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc OSEK_Task_ts3_#t~mem57#1; [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L362-1: SUMMARY for call __startrek_write_cmd_turn((if OSEK_Task_ts3_#t~mem57#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem57#1 % 256 % 256 else OSEK_Task_ts3_#t~mem57#1 % 256 % 256 - 256)); srcloc: null [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1531-1: assume __startrek_assert_i1_#t~switch1091#1;call write~int#3(0, ~#__startrek_Assert_t2_i1~0.base, ~#__startrek_Assert_t2_i1~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1531-1: assume !__startrek_assert_i1_#t~switch1091#1;havoc __startrek_assert_i1_#t~switch1091#1;havoc __startrek_assert_i1_#t~switch1091#1;havoc __startrek_assert_i1_#t~switch1091#1, __startrek_assert_i1_~arg#1;havoc __startrek_assert_i1_#in~arg#1;assume { :end_inline___startrek_assert_i1 } true;OSEK_Task_ts3_~wrote~0#1 := 1; [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;havoc ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1;assume { :end_inline_ecrobot_bt_data_logger } true; [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1515: assume 0 != (if ~__startrek_hyper_period~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_hyper_period~0 % 256 % 4294967296 else ~__startrek_hyper_period~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1515: assume !(0 != (if ~__startrek_hyper_period~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_hyper_period~0 % 256 % 4294967296 else ~__startrek_hyper_period~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:15:38,421 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: OSEK_Task_ts3_~tmp___0~3#1 := (if 0 == OSEK_Task_ts3_#t~ret58#1 % 256 then 0 else 1);havoc OSEK_Task_ts3_#t~ret58#1; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L363-1: SUMMARY for call OSEK_Task_ts3_#t~ret58#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: OSEK_Task_ts3_~tmp___2~1#1 := (if 0 == OSEK_Task_ts3_#t~ret55#1 % 256 then 0 else 1); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L359-1: SUMMARY for call OSEK_Task_ts3_#t~ret55#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528-1: assume __startrek_assert_i1_#t~switch1091#1;call write~int#4(0, ~#__startrek_Assert_t1_i1~0.base, ~#__startrek_Assert_t1_i1~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528-1: assume !__startrek_assert_i1_#t~switch1091#1;__startrek_assert_i1_#t~switch1091#1 := __startrek_assert_i1_#t~switch1091#1 || 2 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356-1: assume 0 != OSEK_Task_ts3_~wrote~0#1 % 256; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356-1: assume !(0 != OSEK_Task_ts3_~wrote~0#1 % 256); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356-2: assume 0 != OSEK_Task_ts3_~tmp___0~3#1 % 256;OSEK_Task_ts3_~tmp___1~2#1 := 0; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356-2: assume !(0 != OSEK_Task_ts3_~tmp___0~3#1 % 256);OSEK_Task_ts3_~tmp___1~2#1 := 1; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356-3: assume 0 == OSEK_Task_ts3_~tmp___2~1#1 % 256;call OSEK_Task_ts3_#t~mem56#1 := read~int#13(~#bt_receive_buf~0.base, ~#bt_receive_buf~0.offset, 1); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356-3: assume !(0 == OSEK_Task_ts3_~tmp___2~1#1 % 256); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: assume -128 <= OSEK_Task_ts3_#t~ret59#1 && OSEK_Task_ts3_#t~ret59#1 <= 127;OSEK_Task_ts3_~tmp___3~1#1 := OSEK_Task_ts3_#t~ret59#1;havoc OSEK_Task_ts3_#t~ret59#1; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L373-1: SUMMARY for call OSEK_Task_ts3_#t~ret59#1 := __startrek_read_cmd_turn(); srcloc: null [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525-1: assume __startrek_assert_i1_#t~switch1091#1;call write~int#5(0, ~#__startrek_Assert_t0_i1~0.base, ~#__startrek_Assert_t0_i1~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525-1: assume !__startrek_assert_i1_#t~switch1091#1;__startrek_assert_i1_#t~switch1091#1 := __startrek_assert_i1_#t~switch1091#1 || 1 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525-2: __startrek_assert_i1_#t~switch1091#1 := 0 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521: assume (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296) < (if ~__startrek_error_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_error_round~0 % 256 % 4294967296 else ~__startrek_error_round~0 % 256 % 4294967296 - 4294967296);~__startrek_error_round~0 := ~__startrek_round~0; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521: assume !((if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296) < (if ~__startrek_error_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_error_round~0 % 256 % 4294967296 else ~__startrek_error_round~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: assume { :begin_inline___startrek_assert_i1 } true;__startrek_assert_i1_#in~arg#1 := (if 0 == OSEK_Task_ts3_~tmp___1~2#1 then 0 else 1);havoc __startrek_assert_i1_#t~switch1091#1, __startrek_assert_i1_~arg#1;__startrek_assert_i1_~arg#1 := __startrek_assert_i1_#in~arg#1; [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: havoc OSEK_Task_ts3_#t~mem56#1;call OSEK_Task_ts3_#t~mem57#1 := read~int#13(~#bt_receive_buf~0.base, 1 + ~#bt_receive_buf~0.offset, 1); [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-1: SUMMARY for call __startrek_write_cmd_forward((if -(if OSEK_Task_ts3_#t~mem56#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem56#1 % 256 % 256 else OSEK_Task_ts3_#t~mem56#1 % 256 % 256 - 256) % 256 <= 127 then -(if OSEK_Task_ts3_#t~mem56#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem56#1 % 256 % 256 else OSEK_Task_ts3_#t~mem56#1 % 256 % 256 - 256) % 256 else -(if OSEK_Task_ts3_#t~mem56#1 % 256 % 256 <= 127 then OSEK_Task_ts3_#t~mem56#1 % 256 % 256 else OSEK_Task_ts3_#t~mem56#1 % 256 % 256 - 256) % 256 - 256)); srcloc: null [2025-02-07 21:15:38,422 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc ecrobot_read_bt_packet_#t~nondet27#1, ecrobot_read_bt_packet_#t~nondet28#1, ecrobot_read_bt_packet_~bt_receive_buf#1.base, ecrobot_read_bt_packet_~bt_receive_buf#1.offset, ecrobot_read_bt_packet_~sz#1;havoc ecrobot_read_bt_packet_#in~bt_receive_buf#1.base, ecrobot_read_bt_packet_#in~bt_receive_buf#1.offset, ecrobot_read_bt_packet_#in~sz#1;assume { :end_inline_ecrobot_read_bt_packet } true;OSEK_Task_ts3_~wrote~0#1 := 0; [2025-02-07 21:15:45,512 INFO L? ?]: Removed 180 outVars from TransFormulas that were not future-live. [2025-02-07 21:15:45,512 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:15:45,545 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:15:45,545 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:15:45,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:15:45 BoogieIcfgContainer [2025-02-07 21:15:45,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:15:45,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:15:45,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:15:45,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:15:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:15:36" (1/3) ... [2025-02-07 21:15:45,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2394119b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:15:45, skipping insertion in model container [2025-02-07 21:15:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:15:37" (2/3) ... [2025-02-07 21:15:45,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2394119b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:15:45, skipping insertion in model container [2025-02-07 21:15:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:15:45" (3/3) ... [2025-02-07 21:15:45,555 INFO L128 eAbstractionObserver]: Analyzing ICFG rekcba_aso.2.M1-2.c [2025-02-07 21:15:45,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:15:45,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekcba_aso.2.M1-2.c that has 22 procedures, 1366 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 21:15:45,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:15:45,647 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;@741994ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:15:45,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:15:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 1333 states, 820 states have (on average 1.2719512195121951) internal successors, (1043), 857 states have internal predecessors, (1043), 478 states have call successors, (478), 16 states have call predecessors, (478), 16 states have return successors, (478), 478 states have call predecessors, (478), 478 states have call successors, (478) [2025-02-07 21:15:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2025-02-07 21:15:45,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:15:45,714 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:15:45,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:15:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:15:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash -846698275, now seen corresponding path program 1 times [2025-02-07 21:15:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:15:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335895490] [2025-02-07 21:15:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:15:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:15:46,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1029 statements into 1 equivalence classes. [2025-02-07 21:15:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1029 of 1029 statements. [2025-02-07 21:15:46,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:15:46,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:15:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 37264 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 36992 trivial. 0 not checked. [2025-02-07 21:15:47,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:15:47,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335895490] [2025-02-07 21:15:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335895490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:15:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577987579] [2025-02-07 21:15:47,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:15:47,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:15:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:15:47,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:15:47,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:15:49,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1029 statements into 1 equivalence classes. [2025-02-07 21:15:49,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1029 of 1029 statements. [2025-02-07 21:15:49,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:15:49,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:15:49,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 3964 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:15:49,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:15:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 37264 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 36992 trivial. 0 not checked. [2025-02-07 21:15:49,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:15:49,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577987579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:15:49,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:15:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 21:15:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96510793] [2025-02-07 21:15:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:15:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:15:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:15:49,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:15:49,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:15:49,896 INFO L87 Difference]: Start difference. First operand has 1333 states, 820 states have (on average 1.2719512195121951) internal successors, (1043), 857 states have internal predecessors, (1043), 478 states have call successors, (478), 16 states have call predecessors, (478), 16 states have return successors, (478), 478 states have call predecessors, (478), 478 states have call successors, (478) Second operand has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 2 states have call successors, (138), 2 states have call predecessors, (138), 1 states have return successors, (137), 1 states have call predecessors, (137), 2 states have call successors, (137) [2025-02-07 21:15:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:15:50,058 INFO L93 Difference]: Finished difference Result 2640 states and 4412 transitions. [2025-02-07 21:15:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:15:50,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 2 states have call successors, (138), 2 states have call predecessors, (138), 1 states have return successors, (137), 1 states have call predecessors, (137), 2 states have call successors, (137) Word has length 1029 [2025-02-07 21:15:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:15:50,093 INFO L225 Difference]: With dead ends: 2640 [2025-02-07 21:15:50,093 INFO L226 Difference]: Without dead ends: 1187 [2025-02-07 21:15:50,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:15:50,128 INFO L435 NwaCegarLoop]: 1988 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:15:50,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:15:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-07 21:15:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2025-02-07 21:15:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 730 states have (on average 1.2410958904109588) internal successors, (906), 758 states have internal predecessors, (906), 449 states have call successors, (449), 7 states have call predecessors, (449), 7 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:15:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1803 transitions. [2025-02-07 21:15:50,349 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1803 transitions. Word has length 1029 [2025-02-07 21:15:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:15:50,350 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1803 transitions. [2025-02-07 21:15:50,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 2 states have call successors, (138), 2 states have call predecessors, (138), 1 states have return successors, (137), 1 states have call predecessors, (137), 2 states have call successors, (137) [2025-02-07 21:15:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1803 transitions. [2025-02-07 21:15:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2025-02-07 21:15:50,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:15:50,417 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:15:50,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:15:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 21:15:50,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:15:50,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:15:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1197733876, now seen corresponding path program 1 times [2025-02-07 21:15:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:15:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758862520] [2025-02-07 21:15:50,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:15:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:15:51,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1029 statements into 1 equivalence classes. [2025-02-07 21:15:51,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1029 of 1029 statements. [2025-02-07 21:15:51,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:15:51,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:15:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 37264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37264 trivial. 0 not checked. [2025-02-07 21:15:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:15:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758862520] [2025-02-07 21:15:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758862520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:15:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:15:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:15:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922781598] [2025-02-07 21:15:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:15:56,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:15:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:15:56,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:15:56,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:15:56,513 INFO L87 Difference]: Start difference. First operand 1187 states and 1803 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, (138), 2 states have call predecessors, (138), 1 states have return successors, (137), 1 states have call predecessors, (137), 1 states have call successors, (137) [2025-02-07 21:15:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:15:56,918 INFO L93 Difference]: Finished difference Result 1193 states and 1808 transitions. [2025-02-07 21:15:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:15:56,919 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, (138), 2 states have call predecessors, (138), 1 states have return successors, (137), 1 states have call predecessors, (137), 1 states have call successors, (137) Word has length 1029 [2025-02-07 21:15:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:15:56,940 INFO L225 Difference]: With dead ends: 1193 [2025-02-07 21:15:56,941 INFO L226 Difference]: Without dead ends: 1191 [2025-02-07 21:15:56,942 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:15:56,942 INFO L435 NwaCegarLoop]: 1776 mSDtfsCounter, 1331 mSDsluCounter, 5274 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 7050 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:15:56,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 7050 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:15:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2025-02-07 21:15:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2025-02-07 21:15:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 733 states have (on average 1.2401091405184175) internal successors, (909), 761 states have internal predecessors, (909), 449 states have call successors, (449), 8 states have call predecessors, (449), 8 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:15:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1806 transitions. [2025-02-07 21:15:57,105 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1806 transitions. Word has length 1029 [2025-02-07 21:15:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:15:57,107 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1806 transitions. [2025-02-07 21:15:57,107 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, (138), 2 states have call predecessors, (138), 1 states have return successors, (137), 1 states have call predecessors, (137), 1 states have call successors, (137) [2025-02-07 21:15:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1806 transitions. [2025-02-07 21:15:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2025-02-07 21:15:57,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:15:57,139 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:15:57,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:15:57,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:15:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:15:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -878291254, now seen corresponding path program 1 times [2025-02-07 21:15:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:15:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297151115] [2025-02-07 21:15:57,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:15:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:15:57,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1035 statements into 1 equivalence classes. [2025-02-07 21:15:58,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1035 of 1035 statements. [2025-02-07 21:15:58,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:15:58,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:15:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 37266 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 37264 trivial. 0 not checked. [2025-02-07 21:15:59,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:15:59,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297151115] [2025-02-07 21:15:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297151115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:15:59,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:15:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:15:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631176663] [2025-02-07 21:15:59,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:15:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:15:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:15:59,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:15:59,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:15:59,969 INFO L87 Difference]: Start difference. First operand 1191 states and 1806 transitions. Second operand has 6 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 2 states have call successors, (139), 2 states have call predecessors, (139), 1 states have return successors, (138), 1 states have call predecessors, (138), 1 states have call successors, (138) [2025-02-07 21:16:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:00,252 INFO L93 Difference]: Finished difference Result 1197 states and 1811 transitions. [2025-02-07 21:16:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 2 states have call successors, (139), 2 states have call predecessors, (139), 1 states have return successors, (138), 1 states have call predecessors, (138), 1 states have call successors, (138) Word has length 1035 [2025-02-07 21:16:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:00,261 INFO L225 Difference]: With dead ends: 1197 [2025-02-07 21:16:00,261 INFO L226 Difference]: Without dead ends: 1195 [2025-02-07 21:16:00,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:00,263 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1326 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:00,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-02-07 21:16:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2025-02-07 21:16:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 736 states have (on average 1.2391304347826086) internal successors, (912), 764 states have internal predecessors, (912), 449 states have call successors, (449), 9 states have call predecessors, (449), 9 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1809 transitions. [2025-02-07 21:16:00,350 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1809 transitions. Word has length 1035 [2025-02-07 21:16:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1809 transitions. [2025-02-07 21:16:00,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 2 states have call successors, (139), 2 states have call predecessors, (139), 1 states have return successors, (138), 1 states have call predecessors, (138), 1 states have call successors, (138) [2025-02-07 21:16:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1809 transitions. [2025-02-07 21:16:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2025-02-07 21:16:00,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:00,367 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:00,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:16:00,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1427698722, now seen corresponding path program 1 times [2025-02-07 21:16:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154714512] [2025-02-07 21:16:00,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:00,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1041 statements into 1 equivalence classes. [2025-02-07 21:16:01,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1041 of 1041 statements. [2025-02-07 21:16:01,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:01,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 37272 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 37268 trivial. 0 not checked. [2025-02-07 21:16:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154714512] [2025-02-07 21:16:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154714512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:03,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:03,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143167638] [2025-02-07 21:16:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:03,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:03,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:03,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:03,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:03,019 INFO L87 Difference]: Start difference. First operand 1195 states and 1809 transitions. Second operand has 6 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 2 states have call successors, (140), 2 states have call predecessors, (140), 1 states have return successors, (139), 1 states have call predecessors, (139), 1 states have call successors, (139) [2025-02-07 21:16:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:03,294 INFO L93 Difference]: Finished difference Result 1201 states and 1814 transitions. [2025-02-07 21:16:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:03,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 2 states have call successors, (140), 2 states have call predecessors, (140), 1 states have return successors, (139), 1 states have call predecessors, (139), 1 states have call successors, (139) Word has length 1041 [2025-02-07 21:16:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:03,304 INFO L225 Difference]: With dead ends: 1201 [2025-02-07 21:16:03,305 INFO L226 Difference]: Without dead ends: 1199 [2025-02-07 21:16:03,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:03,306 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1324 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:03,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-02-07 21:16:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2025-02-07 21:16:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 739 states have (on average 1.2381596752368065) internal successors, (915), 767 states have internal predecessors, (915), 449 states have call successors, (449), 10 states have call predecessors, (449), 10 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1812 transitions. [2025-02-07 21:16:03,399 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1812 transitions. Word has length 1041 [2025-02-07 21:16:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:03,401 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1812 transitions. [2025-02-07 21:16:03,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 2 states have call successors, (140), 2 states have call predecessors, (140), 1 states have return successors, (139), 1 states have call predecessors, (139), 1 states have call successors, (139) [2025-02-07 21:16:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1812 transitions. [2025-02-07 21:16:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2025-02-07 21:16:03,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:03,412 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:03,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:16:03,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:03,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash -553687428, now seen corresponding path program 1 times [2025-02-07 21:16:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:03,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159668531] [2025-02-07 21:16:03,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:03,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1047 statements into 1 equivalence classes. [2025-02-07 21:16:04,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1047 of 1047 statements. [2025-02-07 21:16:04,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:04,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 37282 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37276 trivial. 0 not checked. [2025-02-07 21:16:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159668531] [2025-02-07 21:16:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159668531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354635162] [2025-02-07 21:16:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:06,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:06,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:06,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:06,009 INFO L87 Difference]: Start difference. First operand 1199 states and 1812 transitions. Second operand has 6 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 2 states have call successors, (141), 2 states have call predecessors, (141), 1 states have return successors, (140), 1 states have call predecessors, (140), 1 states have call successors, (140) [2025-02-07 21:16:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:06,293 INFO L93 Difference]: Finished difference Result 1205 states and 1817 transitions. [2025-02-07 21:16:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 2 states have call successors, (141), 2 states have call predecessors, (141), 1 states have return successors, (140), 1 states have call predecessors, (140), 1 states have call successors, (140) Word has length 1047 [2025-02-07 21:16:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:06,304 INFO L225 Difference]: With dead ends: 1205 [2025-02-07 21:16:06,304 INFO L226 Difference]: Without dead ends: 1203 [2025-02-07 21:16:06,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:06,308 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1322 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:06,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-02-07 21:16:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2025-02-07 21:16:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 742 states have (on average 1.2371967654986522) internal successors, (918), 770 states have internal predecessors, (918), 449 states have call successors, (449), 11 states have call predecessors, (449), 11 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1815 transitions. [2025-02-07 21:16:06,410 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1815 transitions. Word has length 1047 [2025-02-07 21:16:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:06,413 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1815 transitions. [2025-02-07 21:16:06,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 2 states have call successors, (141), 2 states have call predecessors, (141), 1 states have return successors, (140), 1 states have call predecessors, (140), 1 states have call successors, (140) [2025-02-07 21:16:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1815 transitions. [2025-02-07 21:16:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2025-02-07 21:16:06,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:06,423 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:06,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:16:06,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:06,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 3302488, now seen corresponding path program 1 times [2025-02-07 21:16:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:06,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493475608] [2025-02-07 21:16:06,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:06,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1053 statements into 1 equivalence classes. [2025-02-07 21:16:07,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1053 of 1053 statements. [2025-02-07 21:16:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 37296 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 37288 trivial. 0 not checked. [2025-02-07 21:16:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493475608] [2025-02-07 21:16:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493475608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:08,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723620952] [2025-02-07 21:16:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:08,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:08,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:08,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:08,724 INFO L87 Difference]: Start difference. First operand 1203 states and 1815 transitions. Second operand has 6 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 2 states have call successors, (142), 2 states have call predecessors, (142), 1 states have return successors, (141), 1 states have call predecessors, (141), 1 states have call successors, (141) [2025-02-07 21:16:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:08,940 INFO L93 Difference]: Finished difference Result 1209 states and 1820 transitions. [2025-02-07 21:16:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 2 states have call successors, (142), 2 states have call predecessors, (142), 1 states have return successors, (141), 1 states have call predecessors, (141), 1 states have call successors, (141) Word has length 1053 [2025-02-07 21:16:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:08,948 INFO L225 Difference]: With dead ends: 1209 [2025-02-07 21:16:08,949 INFO L226 Difference]: Without dead ends: 1207 [2025-02-07 21:16:08,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:08,951 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1320 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:08,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-02-07 21:16:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1207. [2025-02-07 21:16:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 745 states have (on average 1.236241610738255) internal successors, (921), 773 states have internal predecessors, (921), 449 states have call successors, (449), 12 states have call predecessors, (449), 12 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1818 transitions. [2025-02-07 21:16:09,047 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1818 transitions. Word has length 1053 [2025-02-07 21:16:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:09,048 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1818 transitions. [2025-02-07 21:16:09,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 2 states have call successors, (142), 2 states have call predecessors, (142), 1 states have return successors, (141), 1 states have call predecessors, (141), 1 states have call successors, (141) [2025-02-07 21:16:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1818 transitions. [2025-02-07 21:16:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2025-02-07 21:16:09,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:09,057 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:16:09,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash -288897994, now seen corresponding path program 1 times [2025-02-07 21:16:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877968671] [2025-02-07 21:16:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:09,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1059 statements into 1 equivalence classes. [2025-02-07 21:16:09,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1059 of 1059 statements. [2025-02-07 21:16:09,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:09,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 37314 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37304 trivial. 0 not checked. [2025-02-07 21:16:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:11,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877968671] [2025-02-07 21:16:11,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877968671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:11,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:11,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849496623] [2025-02-07 21:16:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:11,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:11,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:11,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:11,683 INFO L87 Difference]: Start difference. First operand 1207 states and 1818 transitions. Second operand has 6 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 2 states have call successors, (143), 2 states have call predecessors, (143), 1 states have return successors, (142), 1 states have call predecessors, (142), 1 states have call successors, (142) [2025-02-07 21:16:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:11,906 INFO L93 Difference]: Finished difference Result 1213 states and 1823 transitions. [2025-02-07 21:16:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 2 states have call successors, (143), 2 states have call predecessors, (143), 1 states have return successors, (142), 1 states have call predecessors, (142), 1 states have call successors, (142) Word has length 1059 [2025-02-07 21:16:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:11,918 INFO L225 Difference]: With dead ends: 1213 [2025-02-07 21:16:11,919 INFO L226 Difference]: Without dead ends: 1211 [2025-02-07 21:16:11,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:11,920 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1318 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:11,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-02-07 21:16:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2025-02-07 21:16:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 748 states have (on average 1.2352941176470589) internal successors, (924), 776 states have internal predecessors, (924), 449 states have call successors, (449), 13 states have call predecessors, (449), 13 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1821 transitions. [2025-02-07 21:16:12,045 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1821 transitions. Word has length 1059 [2025-02-07 21:16:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:12,046 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1821 transitions. [2025-02-07 21:16:12,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 2 states have call successors, (143), 2 states have call predecessors, (143), 1 states have return successors, (142), 1 states have call predecessors, (142), 1 states have call successors, (142) [2025-02-07 21:16:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1821 transitions. [2025-02-07 21:16:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-02-07 21:16:12,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:12,061 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:12,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:16:12,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:12,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 632978582, now seen corresponding path program 1 times [2025-02-07 21:16:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373232692] [2025-02-07 21:16:12,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:12,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1065 statements into 1 equivalence classes. [2025-02-07 21:16:12,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1065 of 1065 statements. [2025-02-07 21:16:12,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:12,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 37336 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37324 trivial. 0 not checked. [2025-02-07 21:16:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373232692] [2025-02-07 21:16:14,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373232692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:14,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:14,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244870866] [2025-02-07 21:16:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:14,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:14,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:14,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:14,476 INFO L87 Difference]: Start difference. First operand 1211 states and 1821 transitions. Second operand has 6 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 2 states have call successors, (144), 2 states have call predecessors, (144), 1 states have return successors, (143), 1 states have call predecessors, (143), 1 states have call successors, (143) [2025-02-07 21:16:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:14,706 INFO L93 Difference]: Finished difference Result 1217 states and 1826 transitions. [2025-02-07 21:16:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 2 states have call successors, (144), 2 states have call predecessors, (144), 1 states have return successors, (143), 1 states have call predecessors, (143), 1 states have call successors, (143) Word has length 1065 [2025-02-07 21:16:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:14,714 INFO L225 Difference]: With dead ends: 1217 [2025-02-07 21:16:14,714 INFO L226 Difference]: Without dead ends: 1215 [2025-02-07 21:16:14,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:14,716 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1316 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:14,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-02-07 21:16:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-02-07 21:16:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 751 states have (on average 1.2343541944074568) internal successors, (927), 779 states have internal predecessors, (927), 449 states have call successors, (449), 14 states have call predecessors, (449), 14 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1824 transitions. [2025-02-07 21:16:14,821 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1824 transitions. Word has length 1065 [2025-02-07 21:16:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1824 transitions. [2025-02-07 21:16:14,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 2 states have call successors, (144), 2 states have call predecessors, (144), 1 states have return successors, (143), 1 states have call predecessors, (143), 1 states have call successors, (143) [2025-02-07 21:16:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1824 transitions. [2025-02-07 21:16:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2025-02-07 21:16:14,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:14,831 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:14,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:16:14,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:14,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash 747807736, now seen corresponding path program 1 times [2025-02-07 21:16:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207301037] [2025-02-07 21:16:14,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:15,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1071 statements into 1 equivalence classes. [2025-02-07 21:16:15,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1071 of 1071 statements. [2025-02-07 21:16:15,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:15,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 37362 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 37348 trivial. 0 not checked. [2025-02-07 21:16:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207301037] [2025-02-07 21:16:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207301037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:17,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790735870] [2025-02-07 21:16:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:17,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:17,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:17,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:17,358 INFO L87 Difference]: Start difference. First operand 1215 states and 1824 transitions. Second operand has 6 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 2 states have call successors, (145), 2 states have call predecessors, (145), 1 states have return successors, (144), 1 states have call predecessors, (144), 1 states have call successors, (144) [2025-02-07 21:16:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:17,627 INFO L93 Difference]: Finished difference Result 1221 states and 1829 transitions. [2025-02-07 21:16:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 2 states have call successors, (145), 2 states have call predecessors, (145), 1 states have return successors, (144), 1 states have call predecessors, (144), 1 states have call successors, (144) Word has length 1071 [2025-02-07 21:16:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:17,635 INFO L225 Difference]: With dead ends: 1221 [2025-02-07 21:16:17,635 INFO L226 Difference]: Without dead ends: 1219 [2025-02-07 21:16:17,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:17,637 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1314 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:17,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-02-07 21:16:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2025-02-07 21:16:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 754 states have (on average 1.23342175066313) internal successors, (930), 782 states have internal predecessors, (930), 449 states have call successors, (449), 15 states have call predecessors, (449), 15 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1827 transitions. [2025-02-07 21:16:17,777 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1827 transitions. Word has length 1071 [2025-02-07 21:16:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:17,778 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1827 transitions. [2025-02-07 21:16:17,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 2 states have call successors, (145), 2 states have call predecessors, (145), 1 states have return successors, (144), 1 states have call predecessors, (144), 1 states have call successors, (144) [2025-02-07 21:16:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1827 transitions. [2025-02-07 21:16:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-02-07 21:16:17,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:17,787 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:17,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:16:17,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 17658076, now seen corresponding path program 1 times [2025-02-07 21:16:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524588946] [2025-02-07 21:16:17,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:17,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:18,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-02-07 21:16:18,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-02-07 21:16:18,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:18,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 37392 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 37376 trivial. 0 not checked. [2025-02-07 21:16:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524588946] [2025-02-07 21:16:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524588946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660826524] [2025-02-07 21:16:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:20,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:20,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:20,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:20,278 INFO L87 Difference]: Start difference. First operand 1219 states and 1827 transitions. Second operand has 6 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 2 states have call successors, (146), 2 states have call predecessors, (146), 1 states have return successors, (145), 1 states have call predecessors, (145), 1 states have call successors, (145) [2025-02-07 21:16:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:20,591 INFO L93 Difference]: Finished difference Result 1225 states and 1832 transitions. [2025-02-07 21:16:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:20,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 2 states have call successors, (146), 2 states have call predecessors, (146), 1 states have return successors, (145), 1 states have call predecessors, (145), 1 states have call successors, (145) Word has length 1077 [2025-02-07 21:16:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:20,602 INFO L225 Difference]: With dead ends: 1225 [2025-02-07 21:16:20,603 INFO L226 Difference]: Without dead ends: 1223 [2025-02-07 21:16:20,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:20,604 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1312 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:20,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-02-07 21:16:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2025-02-07 21:16:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 757 states have (on average 1.2324966974900924) internal successors, (933), 785 states have internal predecessors, (933), 449 states have call successors, (449), 16 states have call predecessors, (449), 16 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1830 transitions. [2025-02-07 21:16:20,797 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1830 transitions. Word has length 1077 [2025-02-07 21:16:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:20,798 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1830 transitions. [2025-02-07 21:16:20,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 2 states have call successors, (146), 2 states have call predecessors, (146), 1 states have return successors, (145), 1 states have call predecessors, (145), 1 states have call successors, (145) [2025-02-07 21:16:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1830 transitions. [2025-02-07 21:16:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2025-02-07 21:16:20,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:20,813 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:16:20,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:20,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1564132926, now seen corresponding path program 1 times [2025-02-07 21:16:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058613290] [2025-02-07 21:16:20,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:21,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1083 statements into 1 equivalence classes. [2025-02-07 21:16:21,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1083 of 1083 statements. [2025-02-07 21:16:21,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:21,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 37426 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37408 trivial. 0 not checked. [2025-02-07 21:16:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058613290] [2025-02-07 21:16:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058613290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:23,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:23,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182340022] [2025-02-07 21:16:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:23,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:23,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:23,649 INFO L87 Difference]: Start difference. First operand 1223 states and 1830 transitions. Second operand has 6 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 2 states have call successors, (147), 2 states have call predecessors, (147), 1 states have return successors, (146), 1 states have call predecessors, (146), 1 states have call successors, (146) [2025-02-07 21:16:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:24,071 INFO L93 Difference]: Finished difference Result 1229 states and 1835 transitions. [2025-02-07 21:16:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 2 states have call successors, (147), 2 states have call predecessors, (147), 1 states have return successors, (146), 1 states have call predecessors, (146), 1 states have call successors, (146) Word has length 1083 [2025-02-07 21:16:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:24,079 INFO L225 Difference]: With dead ends: 1229 [2025-02-07 21:16:24,079 INFO L226 Difference]: Without dead ends: 1227 [2025-02-07 21:16:24,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:24,080 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1310 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:24,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:16:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-02-07 21:16:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2025-02-07 21:16:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 760 states have (on average 1.231578947368421) internal successors, (936), 788 states have internal predecessors, (936), 449 states have call successors, (449), 17 states have call predecessors, (449), 17 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1833 transitions. [2025-02-07 21:16:24,191 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1833 transitions. Word has length 1083 [2025-02-07 21:16:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:24,192 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1833 transitions. [2025-02-07 21:16:24,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 2 states have call successors, (147), 2 states have call predecessors, (147), 1 states have return successors, (146), 1 states have call predecessors, (146), 1 states have call successors, (146) [2025-02-07 21:16:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1833 transitions. [2025-02-07 21:16:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2025-02-07 21:16:24,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:24,201 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:24,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:16:24,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:24,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1087993130, now seen corresponding path program 1 times [2025-02-07 21:16:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144785906] [2025-02-07 21:16:24,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:24,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1089 statements into 1 equivalence classes. [2025-02-07 21:16:24,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1089 of 1089 statements. [2025-02-07 21:16:24,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:24,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 37464 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 37444 trivial. 0 not checked. [2025-02-07 21:16:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144785906] [2025-02-07 21:16:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144785906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744061978] [2025-02-07 21:16:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:26,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:26,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:26,722 INFO L87 Difference]: Start difference. First operand 1227 states and 1833 transitions. Second operand has 6 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 2 states have call successors, (148), 2 states have call predecessors, (148), 1 states have return successors, (147), 1 states have call predecessors, (147), 1 states have call successors, (147) [2025-02-07 21:16:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:26,945 INFO L93 Difference]: Finished difference Result 1233 states and 1838 transitions. [2025-02-07 21:16:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 2 states have call successors, (148), 2 states have call predecessors, (148), 1 states have return successors, (147), 1 states have call predecessors, (147), 1 states have call successors, (147) Word has length 1089 [2025-02-07 21:16:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:26,952 INFO L225 Difference]: With dead ends: 1233 [2025-02-07 21:16:26,952 INFO L226 Difference]: Without dead ends: 1231 [2025-02-07 21:16:26,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:26,953 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1308 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:26,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-02-07 21:16:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1231. [2025-02-07 21:16:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 763 states have (on average 1.2306684141546527) internal successors, (939), 791 states have internal predecessors, (939), 449 states have call successors, (449), 18 states have call predecessors, (449), 18 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1836 transitions. [2025-02-07 21:16:27,070 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1836 transitions. Word has length 1089 [2025-02-07 21:16:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:27,072 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1836 transitions. [2025-02-07 21:16:27,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 2 states have call successors, (148), 2 states have call predecessors, (148), 1 states have return successors, (147), 1 states have call predecessors, (147), 1 states have call successors, (147) [2025-02-07 21:16:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1836 transitions. [2025-02-07 21:16:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2025-02-07 21:16:27,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:27,080 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:27,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:16:27,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1986610796, now seen corresponding path program 1 times [2025-02-07 21:16:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237039667] [2025-02-07 21:16:27,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:27,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1095 statements into 1 equivalence classes. [2025-02-07 21:16:27,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1095 of 1095 statements. [2025-02-07 21:16:27,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:27,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 37506 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 37484 trivial. 0 not checked. [2025-02-07 21:16:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237039667] [2025-02-07 21:16:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237039667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116789166] [2025-02-07 21:16:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:29,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:29,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:29,694 INFO L87 Difference]: Start difference. First operand 1231 states and 1836 transitions. Second operand has 6 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 2 states have call successors, (149), 2 states have call predecessors, (149), 1 states have return successors, (148), 1 states have call predecessors, (148), 1 states have call successors, (148) [2025-02-07 21:16:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:29,919 INFO L93 Difference]: Finished difference Result 1237 states and 1841 transitions. [2025-02-07 21:16:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 2 states have call successors, (149), 2 states have call predecessors, (149), 1 states have return successors, (148), 1 states have call predecessors, (148), 1 states have call successors, (148) Word has length 1095 [2025-02-07 21:16:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:29,926 INFO L225 Difference]: With dead ends: 1237 [2025-02-07 21:16:29,926 INFO L226 Difference]: Without dead ends: 1235 [2025-02-07 21:16:29,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:29,927 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1306 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:29,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-02-07 21:16:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1235. [2025-02-07 21:16:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 766 states have (on average 1.2297650130548303) internal successors, (942), 794 states have internal predecessors, (942), 449 states have call successors, (449), 19 states have call predecessors, (449), 19 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1839 transitions. [2025-02-07 21:16:30,053 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1839 transitions. Word has length 1095 [2025-02-07 21:16:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:30,053 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1839 transitions. [2025-02-07 21:16:30,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 2 states have call successors, (149), 2 states have call predecessors, (149), 1 states have return successors, (148), 1 states have call predecessors, (148), 1 states have call successors, (148) [2025-02-07 21:16:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1839 transitions. [2025-02-07 21:16:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2025-02-07 21:16:30,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:30,063 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:30,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:16:30,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:30,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1675707008, now seen corresponding path program 1 times [2025-02-07 21:16:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690701414] [2025-02-07 21:16:30,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:30,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1101 statements into 1 equivalence classes. [2025-02-07 21:16:30,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1101 of 1101 statements. [2025-02-07 21:16:30,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:30,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 37552 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 37528 trivial. 0 not checked. [2025-02-07 21:16:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690701414] [2025-02-07 21:16:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690701414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:32,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181364648] [2025-02-07 21:16:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:32,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:32,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:32,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:32,858 INFO L87 Difference]: Start difference. First operand 1235 states and 1839 transitions. Second operand has 6 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 2 states have call successors, (150), 2 states have call predecessors, (150), 1 states have return successors, (149), 1 states have call predecessors, (149), 1 states have call successors, (149) [2025-02-07 21:16:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:33,109 INFO L93 Difference]: Finished difference Result 1241 states and 1844 transitions. [2025-02-07 21:16:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 2 states have call successors, (150), 2 states have call predecessors, (150), 1 states have return successors, (149), 1 states have call predecessors, (149), 1 states have call successors, (149) Word has length 1101 [2025-02-07 21:16:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:33,115 INFO L225 Difference]: With dead ends: 1241 [2025-02-07 21:16:33,115 INFO L226 Difference]: Without dead ends: 1239 [2025-02-07 21:16:33,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:33,116 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1304 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:33,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-02-07 21:16:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2025-02-07 21:16:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 769 states have (on average 1.2288686605981796) internal successors, (945), 797 states have internal predecessors, (945), 449 states have call successors, (449), 20 states have call predecessors, (449), 20 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1842 transitions. [2025-02-07 21:16:33,254 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1842 transitions. Word has length 1101 [2025-02-07 21:16:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:33,255 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1842 transitions. [2025-02-07 21:16:33,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 2 states have call successors, (150), 2 states have call predecessors, (150), 1 states have return successors, (149), 1 states have call predecessors, (149), 1 states have call successors, (149) [2025-02-07 21:16:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1842 transitions. [2025-02-07 21:16:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2025-02-07 21:16:33,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:33,264 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:33,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:16:33,265 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash 470833006, now seen corresponding path program 1 times [2025-02-07 21:16:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:33,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174968173] [2025-02-07 21:16:33,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:33,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1107 statements into 1 equivalence classes. [2025-02-07 21:16:33,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1107 of 1107 statements. [2025-02-07 21:16:33,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:33,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 37602 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 37576 trivial. 0 not checked. [2025-02-07 21:16:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174968173] [2025-02-07 21:16:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174968173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896057874] [2025-02-07 21:16:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:36,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:36,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:36,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:36,139 INFO L87 Difference]: Start difference. First operand 1239 states and 1842 transitions. Second operand has 6 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 2 states have call successors, (151), 2 states have call predecessors, (151), 1 states have return successors, (150), 1 states have call predecessors, (150), 1 states have call successors, (150) [2025-02-07 21:16:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:36,352 INFO L93 Difference]: Finished difference Result 1245 states and 1847 transitions. [2025-02-07 21:16:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:36,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 2 states have call successors, (151), 2 states have call predecessors, (151), 1 states have return successors, (150), 1 states have call predecessors, (150), 1 states have call successors, (150) Word has length 1107 [2025-02-07 21:16:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:36,358 INFO L225 Difference]: With dead ends: 1245 [2025-02-07 21:16:36,358 INFO L226 Difference]: Without dead ends: 1243 [2025-02-07 21:16:36,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:36,359 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1302 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:36,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-02-07 21:16:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1243. [2025-02-07 21:16:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 772 states have (on average 1.2279792746113989) internal successors, (948), 800 states have internal predecessors, (948), 449 states have call successors, (449), 21 states have call predecessors, (449), 21 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1845 transitions. [2025-02-07 21:16:36,496 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1845 transitions. Word has length 1107 [2025-02-07 21:16:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:36,497 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1845 transitions. [2025-02-07 21:16:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 2 states have call successors, (151), 2 states have call predecessors, (151), 1 states have return successors, (150), 1 states have call predecessors, (150), 1 states have call successors, (150) [2025-02-07 21:16:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1845 transitions. [2025-02-07 21:16:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2025-02-07 21:16:36,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:36,528 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:36,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:16:36,529 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -416317986, now seen corresponding path program 1 times [2025-02-07 21:16:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551764389] [2025-02-07 21:16:36,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:36,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1113 statements into 1 equivalence classes. [2025-02-07 21:16:37,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1113 of 1113 statements. [2025-02-07 21:16:37,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:37,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 37656 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37628 trivial. 0 not checked. [2025-02-07 21:16:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551764389] [2025-02-07 21:16:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551764389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177042571] [2025-02-07 21:16:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:39,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:39,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:39,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:39,386 INFO L87 Difference]: Start difference. First operand 1243 states and 1845 transitions. Second operand has 6 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 2 states have call successors, (152), 2 states have call predecessors, (152), 1 states have return successors, (151), 1 states have call predecessors, (151), 1 states have call successors, (151) [2025-02-07 21:16:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:39,630 INFO L93 Difference]: Finished difference Result 1249 states and 1850 transitions. [2025-02-07 21:16:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:39,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 2 states have call successors, (152), 2 states have call predecessors, (152), 1 states have return successors, (151), 1 states have call predecessors, (151), 1 states have call successors, (151) Word has length 1113 [2025-02-07 21:16:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:39,636 INFO L225 Difference]: With dead ends: 1249 [2025-02-07 21:16:39,636 INFO L226 Difference]: Without dead ends: 1247 [2025-02-07 21:16:39,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:39,638 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1300 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:39,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-02-07 21:16:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2025-02-07 21:16:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 775 states have (on average 1.2270967741935483) internal successors, (951), 803 states have internal predecessors, (951), 449 states have call successors, (449), 22 states have call predecessors, (449), 22 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1848 transitions. [2025-02-07 21:16:39,772 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1848 transitions. Word has length 1113 [2025-02-07 21:16:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:39,773 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1848 transitions. [2025-02-07 21:16:39,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 2 states have call successors, (152), 2 states have call predecessors, (152), 1 states have return successors, (151), 1 states have call predecessors, (151), 1 states have call successors, (151) [2025-02-07 21:16:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1848 transitions. [2025-02-07 21:16:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2025-02-07 21:16:39,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:39,782 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 21:16:39,783 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -317896880, now seen corresponding path program 1 times [2025-02-07 21:16:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586552491] [2025-02-07 21:16:39,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:39,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1119 statements into 1 equivalence classes. [2025-02-07 21:16:40,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1119 of 1119 statements. [2025-02-07 21:16:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:40,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 37714 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 37684 trivial. 0 not checked. [2025-02-07 21:16:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:42,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586552491] [2025-02-07 21:16:42,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586552491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:42,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:42,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867204342] [2025-02-07 21:16:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:42,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:42,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:42,817 INFO L87 Difference]: Start difference. First operand 1247 states and 1848 transitions. Second operand has 6 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 2 states have call successors, (153), 2 states have call predecessors, (153), 1 states have return successors, (152), 1 states have call predecessors, (152), 1 states have call successors, (152) [2025-02-07 21:16:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:43,042 INFO L93 Difference]: Finished difference Result 1253 states and 1853 transitions. [2025-02-07 21:16:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:43,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 2 states have call successors, (153), 2 states have call predecessors, (153), 1 states have return successors, (152), 1 states have call predecessors, (152), 1 states have call successors, (152) Word has length 1119 [2025-02-07 21:16:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:43,048 INFO L225 Difference]: With dead ends: 1253 [2025-02-07 21:16:43,048 INFO L226 Difference]: Without dead ends: 1251 [2025-02-07 21:16:43,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:16:43,050 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1298 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:43,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-02-07 21:16:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-02-07 21:16:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 778 states have (on average 1.2262210796915167) internal successors, (954), 806 states have internal predecessors, (954), 449 states have call successors, (449), 23 states have call predecessors, (449), 23 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1851 transitions. [2025-02-07 21:16:43,194 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1851 transitions. Word has length 1119 [2025-02-07 21:16:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:43,195 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1851 transitions. [2025-02-07 21:16:43,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 2 states have call successors, (153), 2 states have call predecessors, (153), 1 states have return successors, (152), 1 states have call predecessors, (152), 1 states have call successors, (152) [2025-02-07 21:16:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1851 transitions. [2025-02-07 21:16:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2025-02-07 21:16:43,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:43,204 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:43,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:16:43,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:43,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1464866236, now seen corresponding path program 1 times [2025-02-07 21:16:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577088091] [2025-02-07 21:16:43,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:43,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-02-07 21:16:43,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-02-07 21:16:43,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:43,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 37776 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 37744 trivial. 0 not checked. [2025-02-07 21:16:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577088091] [2025-02-07 21:16:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577088091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006942463] [2025-02-07 21:16:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:46,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:46,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:46,193 INFO L87 Difference]: Start difference. First operand 1251 states and 1851 transitions. Second operand has 6 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 2 states have call successors, (154), 2 states have call predecessors, (154), 1 states have return successors, (153), 1 states have call predecessors, (153), 1 states have call successors, (153) [2025-02-07 21:16:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:46,419 INFO L93 Difference]: Finished difference Result 1257 states and 1856 transitions. [2025-02-07 21:16:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 2 states have call successors, (154), 2 states have call predecessors, (154), 1 states have return successors, (153), 1 states have call predecessors, (153), 1 states have call successors, (153) Word has length 1125 [2025-02-07 21:16:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:46,425 INFO L225 Difference]: With dead ends: 1257 [2025-02-07 21:16:46,425 INFO L226 Difference]: Without dead ends: 1255 [2025-02-07 21:16:46,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:46,426 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1296 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:46,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-02-07 21:16:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-02-07 21:16:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 781 states have (on average 1.2253521126760563) internal successors, (957), 809 states have internal predecessors, (957), 449 states have call successors, (449), 24 states have call predecessors, (449), 24 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1854 transitions. [2025-02-07 21:16:46,569 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1854 transitions. Word has length 1125 [2025-02-07 21:16:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:46,570 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1854 transitions. [2025-02-07 21:16:46,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 2 states have call successors, (154), 2 states have call predecessors, (154), 1 states have return successors, (153), 1 states have call predecessors, (153), 1 states have call successors, (153) [2025-02-07 21:16:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1854 transitions. [2025-02-07 21:16:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2025-02-07 21:16:46,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:46,579 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:46,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 21:16:46,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:46,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1137001158, now seen corresponding path program 1 times [2025-02-07 21:16:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:46,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024114189] [2025-02-07 21:16:46,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:46,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1131 statements into 1 equivalence classes. [2025-02-07 21:16:47,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1131 of 1131 statements. [2025-02-07 21:16:47,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:47,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 37842 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 37808 trivial. 0 not checked. [2025-02-07 21:16:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:49,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024114189] [2025-02-07 21:16:49,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024114189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:49,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:49,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120509904] [2025-02-07 21:16:49,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:49,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:49,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:49,741 INFO L87 Difference]: Start difference. First operand 1255 states and 1854 transitions. Second operand has 6 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 2 states have call successors, (155), 2 states have call predecessors, (155), 1 states have return successors, (154), 1 states have call predecessors, (154), 1 states have call successors, (154) [2025-02-07 21:16:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:50,008 INFO L93 Difference]: Finished difference Result 1261 states and 1859 transitions. [2025-02-07 21:16:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:50,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 2 states have call successors, (155), 2 states have call predecessors, (155), 1 states have return successors, (154), 1 states have call predecessors, (154), 1 states have call successors, (154) Word has length 1131 [2025-02-07 21:16:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:50,017 INFO L225 Difference]: With dead ends: 1261 [2025-02-07 21:16:50,018 INFO L226 Difference]: Without dead ends: 1259 [2025-02-07 21:16:50,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:50,019 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1294 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:50,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-02-07 21:16:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2025-02-07 21:16:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 784 states have (on average 1.2244897959183674) internal successors, (960), 812 states have internal predecessors, (960), 449 states have call successors, (449), 25 states have call predecessors, (449), 25 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1857 transitions. [2025-02-07 21:16:50,327 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1857 transitions. Word has length 1131 [2025-02-07 21:16:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1857 transitions. [2025-02-07 21:16:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 2 states have call successors, (155), 2 states have call predecessors, (155), 1 states have return successors, (154), 1 states have call predecessors, (154), 1 states have call successors, (154) [2025-02-07 21:16:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1857 transitions. [2025-02-07 21:16:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2025-02-07 21:16:50,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:50,344 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 21:16:50,344 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 781596338, now seen corresponding path program 1 times [2025-02-07 21:16:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163947385] [2025-02-07 21:16:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:50,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1137 statements into 1 equivalence classes. [2025-02-07 21:16:51,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1137 of 1137 statements. [2025-02-07 21:16:51,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:51,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 37912 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 37876 trivial. 0 not checked. [2025-02-07 21:16:53,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:53,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163947385] [2025-02-07 21:16:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163947385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:53,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380236551] [2025-02-07 21:16:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:53,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:53,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:53,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:53,785 INFO L87 Difference]: Start difference. First operand 1259 states and 1857 transitions. Second operand has 6 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 2 states have call successors, (156), 2 states have call predecessors, (156), 1 states have return successors, (155), 1 states have call predecessors, (155), 1 states have call successors, (155) [2025-02-07 21:16:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:54,020 INFO L93 Difference]: Finished difference Result 1265 states and 1862 transitions. [2025-02-07 21:16:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 2 states have call successors, (156), 2 states have call predecessors, (156), 1 states have return successors, (155), 1 states have call predecessors, (155), 1 states have call successors, (155) Word has length 1137 [2025-02-07 21:16:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:54,025 INFO L225 Difference]: With dead ends: 1265 [2025-02-07 21:16:54,025 INFO L226 Difference]: Without dead ends: 1263 [2025-02-07 21:16:54,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:16:54,026 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1292 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:54,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-02-07 21:16:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2025-02-07 21:16:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 787 states have (on average 1.2236340533672172) internal successors, (963), 815 states have internal predecessors, (963), 449 states have call successors, (449), 26 states have call predecessors, (449), 26 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1860 transitions. [2025-02-07 21:16:54,181 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1860 transitions. Word has length 1137 [2025-02-07 21:16:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1860 transitions. [2025-02-07 21:16:54,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 2 states have call successors, (156), 2 states have call predecessors, (156), 1 states have return successors, (155), 1 states have call predecessors, (155), 1 states have call successors, (155) [2025-02-07 21:16:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1860 transitions. [2025-02-07 21:16:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2025-02-07 21:16:54,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:54,191 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:54,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 21:16:54,191 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:54,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -887624404, now seen corresponding path program 1 times [2025-02-07 21:16:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:54,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531280479] [2025-02-07 21:16:54,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:54,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1143 statements into 1 equivalence classes. [2025-02-07 21:16:54,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1143 of 1143 statements. [2025-02-07 21:16:54,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:54,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:16:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 37986 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 37948 trivial. 0 not checked. [2025-02-07 21:16:57,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:16:57,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531280479] [2025-02-07 21:16:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531280479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:16:57,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:16:57,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:16:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818819518] [2025-02-07 21:16:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:16:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:16:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:16:57,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:16:57,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:16:57,526 INFO L87 Difference]: Start difference. First operand 1263 states and 1860 transitions. Second operand has 6 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 2 states have call successors, (157), 2 states have call predecessors, (157), 1 states have return successors, (156), 1 states have call predecessors, (156), 1 states have call successors, (156) [2025-02-07 21:16:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:16:57,761 INFO L93 Difference]: Finished difference Result 1269 states and 1865 transitions. [2025-02-07 21:16:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:16:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 2 states have call successors, (157), 2 states have call predecessors, (157), 1 states have return successors, (156), 1 states have call predecessors, (156), 1 states have call successors, (156) Word has length 1143 [2025-02-07 21:16:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:16:57,766 INFO L225 Difference]: With dead ends: 1269 [2025-02-07 21:16:57,766 INFO L226 Difference]: Without dead ends: 1267 [2025-02-07 21:16:57,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:16:57,767 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1290 mSDsluCounter, 5278 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 7057 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:16:57,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 7057 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:16:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-02-07 21:16:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1267. [2025-02-07 21:16:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 790 states have (on average 1.2227848101265824) internal successors, (966), 818 states have internal predecessors, (966), 449 states have call successors, (449), 27 states have call predecessors, (449), 27 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2025-02-07 21:16:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1863 transitions. [2025-02-07 21:16:57,928 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1863 transitions. Word has length 1143 [2025-02-07 21:16:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:16:57,928 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1863 transitions. [2025-02-07 21:16:57,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 2 states have call successors, (157), 2 states have call predecessors, (157), 1 states have return successors, (156), 1 states have call predecessors, (156), 1 states have call successors, (156) [2025-02-07 21:16:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1863 transitions. [2025-02-07 21:16:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1150 [2025-02-07 21:16:57,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:16:57,936 INFO L218 NwaCegarLoop]: trace histogram [137, 137, 137, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:16:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 21:16:57,936 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:16:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:16:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 589993768, now seen corresponding path program 1 times [2025-02-07 21:16:57,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:16:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300497722] [2025-02-07 21:16:57,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:16:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:16:58,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1149 statements into 1 equivalence classes. [2025-02-07 21:16:58,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1149 of 1149 statements. [2025-02-07 21:16:58,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:16:58,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat