./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_aso.1.M1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_aso.1.M1-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2db6eb55010ab7d3a1a946055e6deb2837efdfd8388654051519bf5d1a66e523 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:32:05,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:32:05,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:32:05,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:32:05,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:32:05,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:32:05,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:32:05,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:32:05,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:32:05,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:32:05,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:32:05,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:32:05,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:32:05,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:32:05,448 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:32:05,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:32:05,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:32:05,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:32:05,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:32:05,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:32:05,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:32:05,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:32:05,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:32:05,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:32:05,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:32:05,453 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 -> 2db6eb55010ab7d3a1a946055e6deb2837efdfd8388654051519bf5d1a66e523 [2025-01-09 04:32:05,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:32:05,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:32:05,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:32:05,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:32:05,771 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:32:05,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_aso.1.M1-1.c [2025-01-09 04:32:07,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd61899f9/a4b77aad0cdf42d691b7bf08c3cf5130/FLAGd7e2a9fec [2025-01-09 04:32:07,495 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:32:07,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_aso.1.M1-1.c [2025-01-09 04:32:07,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd61899f9/a4b77aad0cdf42d691b7bf08c3cf5130/FLAGd7e2a9fec [2025-01-09 04:32:07,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd61899f9/a4b77aad0cdf42d691b7bf08c3cf5130 [2025-01-09 04:32:07,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:32:07,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:32:07,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:32:07,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:32:07,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:32:07,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:32:07" (1/1) ... [2025-01-09 04:32:07,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578ae596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:07, skipping insertion in model container [2025-01-09 04:32:07,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:32:07" (1/1) ... [2025-01-09 04:32:07,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:32:07,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_aso.1.M1-1.c[1800,1813] [2025-01-09 04:32:08,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:32:08,143 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:32:08,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/aso.ok1.i","-S") [43] [2025-01-09 04:32:08,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_aso.1.M1-1.c[1800,1813] [2025-01-09 04:32:08,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:32:08,473 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:32:08,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08 WrapperNode [2025-01-09 04:32:08,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:32:08,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:32:08,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:32:08,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:32:08,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:08,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:08,901 INFO L138 Inliner]: procedures = 60, calls = 3453, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 7521 [2025-01-09 04:32:08,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:32:08,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:32:08,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:32:08,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:32:08,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:08,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:08,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,062 INFO L175 MemorySlicer]: Split 2465 memory accesses to 19 slices as follows [2, 319, 355, 113, 113, 180, 203, 180, 203, 4, 180, 203, 2, 7, 180, 203, 8, 2, 8]. 14 percent of accesses are in the largest equivalence class. The 328 initializations are split as follows [2, 27, 27, 27, 27, 27, 27, 27, 27, 0, 27, 27, 0, 2, 27, 27, 0, 0, 0]. The 337 writes are split as follows [0, 27, 27, 27, 27, 28, 26, 28, 26, 0, 28, 26, 1, 3, 28, 26, 4, 1, 4]. [2025-01-09 04:32:09,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:32:09,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:32:09,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:32:09,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:32:09,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (1/1) ... [2025-01-09 04:32:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:32:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:32:09,467 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-01-09 04:32:09,472 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-01-09 04:32:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:32:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_cmd_forward [2025-01-09 04:32:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_cmd_forward [2025-01-09 04:32:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-01-09 04:32:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-01-09 04:32:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-01-09 04:32:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-01-09 04:32:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:32:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-01-09 04:32:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-01-09 04:32:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-01-09 04:32:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-01-09 04:32:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-01-09 04:32:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-01-09 04:32:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:32:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:32:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:32:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 04:32:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-01-09 04:32:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-01-09 04:32:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_cmd_turn [2025-01-09 04:32:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_cmd_turn [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-01-09 04:32:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-01-09 04:32:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts3 [2025-01-09 04:32:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts3 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 04:32:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:32:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-01-09 04:32:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_cmd_forward [2025-01-09 04:32:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_cmd_forward [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_obstacle_flag [2025-01-09 04:32:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_obstacle_flag [2025-01-09 04:32:09,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 04:32:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 04:32:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:32:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:32:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:32:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:32:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:32:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:32:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:32:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 04:32:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 04:32:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 04:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 04:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 04:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 04:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:32:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-01-09 04:32:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-01-09 04:32:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-01-09 04:32:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-01-09 04:32:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-01-09 04:32:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-01-09 04:32:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_cmd_turn [2025-01-09 04:32:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_cmd_turn [2025-01-09 04:32:10,081 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:32:10,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:32:19,143 INFO L? ?]: Removed 405 outVars from TransFormulas that were not future-live. [2025-01-09 04:32:19,144 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:32:19,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:32:19,221 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:32:19,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:32:19 BoogieIcfgContainer [2025-01-09 04:32:19,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:32:19,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:32:19,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:32:19,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:32:19,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:32:07" (1/3) ... [2025-01-09 04:32:19,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66578db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:32:19, skipping insertion in model container [2025-01-09 04:32:19,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:32:08" (2/3) ... [2025-01-09 04:32:19,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66578db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:32:19, skipping insertion in model container [2025-01-09 04:32:19,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:32:19" (3/3) ... [2025-01-09 04:32:19,229 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_aso.1.M1-1.c [2025-01-09 04:32:19,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:32:19,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_aso.1.M1-1.c that has 22 procedures, 2210 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:32:19,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:32:19,368 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;@2f1d6114, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:32:19,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:32:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 2210 states, 1249 states have (on average 1.2177742193755003) internal successors, (1521), 1378 states have internal predecessors, (1521), 938 states have call successors, (938), 21 states have call predecessors, (938), 21 states have return successors, (938), 838 states have call predecessors, (938), 938 states have call successors, (938) [2025-01-09 04:32:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1337 [2025-01-09 04:32:19,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:32:19,458 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:32:19,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:32:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:32:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -562365992, now seen corresponding path program 1 times [2025-01-09 04:32:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:32:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803486009] [2025-01-09 04:32:19,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:32:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:32:20,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1336 statements into 1 equivalence classes. [2025-01-09 04:32:21,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1336 of 1336 statements. [2025-01-09 04:32:21,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:32:21,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:32:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-01-09 04:32:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:32:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803486009] [2025-01-09 04:32:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803486009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:32:22,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:32:22,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:32:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131075497] [2025-01-09 04:32:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:32:22,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:32:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:32:22,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:32:22,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:32:22,810 INFO L87 Difference]: Start difference. First operand has 2210 states, 1249 states have (on average 1.2177742193755003) internal successors, (1521), 1378 states have internal predecessors, (1521), 938 states have call successors, (938), 21 states have call predecessors, (938), 21 states have return successors, (938), 838 states have call predecessors, (938), 938 states have call successors, (938) Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 2 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-01-09 04:32:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:32:23,154 INFO L93 Difference]: Finished difference Result 4415 states and 7706 transitions. [2025-01-09 04:32:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:32:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 2 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1336 [2025-01-09 04:32:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:32:23,203 INFO L225 Difference]: With dead ends: 4415 [2025-01-09 04:32:23,203 INFO L226 Difference]: Without dead ends: 2205 [2025-01-09 04:32:23,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:32:23,236 INFO L435 NwaCegarLoop]: 3393 mSDtfsCounter, 0 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6776 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:32:23,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:32:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2025-01-09 04:32:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2205. [2025-01-09 04:32:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1245 states have (on average 1.2160642570281124) internal successors, (1514), 1374 states have internal predecessors, (1514), 938 states have call successors, (938), 21 states have call predecessors, (938), 21 states have return successors, (937), 837 states have call predecessors, (937), 937 states have call successors, (937) [2025-01-09 04:32:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3389 transitions. [2025-01-09 04:32:23,747 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3389 transitions. Word has length 1336 [2025-01-09 04:32:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:32:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3389 transitions. [2025-01-09 04:32:23,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 2 states have call successors, (212), 2 states have call predecessors, (212), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-01-09 04:32:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3389 transitions. [2025-01-09 04:32:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2025-01-09 04:32:23,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:32:23,804 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:32:23,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:32:23,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:32:23,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:32:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash -785683364, now seen corresponding path program 1 times [2025-01-09 04:32:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:32:23,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630167872] [2025-01-09 04:32:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:32:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:32:24,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1344 statements into 1 equivalence classes. [2025-01-09 04:32:24,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1344 of 1344 statements. [2025-01-09 04:32:24,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:32:24,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:32:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86947 trivial. 0 not checked. [2025-01-09 04:32:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:32:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630167872] [2025-01-09 04:32:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630167872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:32:30,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:32:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:32:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662566390] [2025-01-09 04:32:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:32:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:32:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:32:30,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:32:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:32:30,165 INFO L87 Difference]: Start difference. First operand 2205 states and 3389 transitions. Second operand has 5 states, 4 states have (on average 72.75) internal successors, (291), 5 states have internal predecessors, (291), 4 states have call successors, (214), 2 states have call predecessors, (214), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-01-09 04:32:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:32:35,719 INFO L93 Difference]: Finished difference Result 4122 states and 6350 transitions. [2025-01-09 04:32:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:32:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 72.75) internal successors, (291), 5 states have internal predecessors, (291), 4 states have call successors, (214), 2 states have call predecessors, (214), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) Word has length 1344 [2025-01-09 04:32:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:32:35,759 INFO L225 Difference]: With dead ends: 4122 [2025-01-09 04:32:35,760 INFO L226 Difference]: Without dead ends: 2490 [2025-01-09 04:32:35,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:32:35,777 INFO L435 NwaCegarLoop]: 3761 mSDtfsCounter, 4753 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4753 SdHoareTripleChecker+Valid, 5484 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:32:35,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4753 Valid, 5484 Invalid, 3262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1144 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 04:32:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2025-01-09 04:32:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2488. [2025-01-09 04:32:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 1453 states have (on average 1.2339986235375087) internal successors, (1793), 1582 states have internal predecessors, (1793), 1004 states have call successors, (1004), 30 states have call predecessors, (1004), 30 states have return successors, (1003), 903 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 04:32:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3800 transitions. [2025-01-09 04:32:36,262 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3800 transitions. Word has length 1344 [2025-01-09 04:32:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:32:36,266 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3800 transitions. [2025-01-09 04:32:36,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 72.75) internal successors, (291), 5 states have internal predecessors, (291), 4 states have call successors, (214), 2 states have call predecessors, (214), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-01-09 04:32:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3800 transitions. [2025-01-09 04:32:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2025-01-09 04:32:36,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:32:36,288 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:32:36,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:32:36,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:32:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:32:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 59333723, now seen corresponding path program 1 times [2025-01-09 04:32:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:32:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576206962] [2025-01-09 04:32:36,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:32:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:32:36,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1348 statements into 1 equivalence classes. [2025-01-09 04:32:37,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1348 of 1348 statements. [2025-01-09 04:32:37,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:32:37,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:32:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86947 trivial. 0 not checked. [2025-01-09 04:32:38,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:32:38,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576206962] [2025-01-09 04:32:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576206962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:32:38,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:32:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:32:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919426216] [2025-01-09 04:32:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:32:38,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:32:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:32:38,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:32:38,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:32:38,994 INFO L87 Difference]: Start difference. First operand 2488 states and 3800 transitions. Second operand has 5 states, 4 states have (on average 73.25) internal successors, (293), 5 states have internal predecessors, (293), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-01-09 04:32:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:32:42,956 INFO L93 Difference]: Finished difference Result 4401 states and 6754 transitions. [2025-01-09 04:32:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:32:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 73.25) internal successors, (293), 5 states have internal predecessors, (293), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) Word has length 1348 [2025-01-09 04:32:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:32:42,984 INFO L225 Difference]: With dead ends: 4401 [2025-01-09 04:32:42,985 INFO L226 Difference]: Without dead ends: 2486 [2025-01-09 04:32:42,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:32:43,000 INFO L435 NwaCegarLoop]: 3754 mSDtfsCounter, 3760 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3760 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:32:43,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3760 Valid, 6232 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 04:32:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-01-09 04:32:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2484. [2025-01-09 04:32:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1451 states have (on average 1.2329427980702963) internal successors, (1789), 1580 states have internal predecessors, (1789), 1002 states have call successors, (1002), 30 states have call predecessors, (1002), 30 states have return successors, (1001), 901 states have call predecessors, (1001), 1001 states have call successors, (1001) [2025-01-09 04:32:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3792 transitions. [2025-01-09 04:32:43,382 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3792 transitions. Word has length 1348 [2025-01-09 04:32:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:32:43,384 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3792 transitions. [2025-01-09 04:32:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 73.25) internal successors, (293), 5 states have internal predecessors, (293), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-01-09 04:32:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3792 transitions. [2025-01-09 04:32:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2025-01-09 04:32:43,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:32:43,403 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:32:43,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:32:43,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:32:43,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:32:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1235309664, now seen corresponding path program 1 times [2025-01-09 04:32:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:32:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612106398] [2025-01-09 04:32:43,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:32:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:32:44,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1349 statements into 1 equivalence classes. [2025-01-09 04:32:44,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1349 of 1349 statements. [2025-01-09 04:32:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:32:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:32:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86947 trivial. 0 not checked. [2025-01-09 04:32:47,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:32:47,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612106398] [2025-01-09 04:32:47,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612106398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:32:47,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:32:47,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:32:47,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509942688] [2025-01-09 04:32:47,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:32:47,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:32:47,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:32:47,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:32:47,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:32:47,435 INFO L87 Difference]: Start difference. First operand 2484 states and 3792 transitions. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 5 states have internal predecessors, (294), 3 states have call successors, (215), 3 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-01-09 04:32:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:32:53,182 INFO L93 Difference]: Finished difference Result 4299 states and 6589 transitions. [2025-01-09 04:32:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:32:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 5 states have internal predecessors, (294), 3 states have call successors, (215), 3 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) Word has length 1349 [2025-01-09 04:32:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:32:53,220 INFO L225 Difference]: With dead ends: 4299 [2025-01-09 04:32:53,220 INFO L226 Difference]: Without dead ends: 4276 [2025-01-09 04:32:53,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:32:53,224 INFO L435 NwaCegarLoop]: 3381 mSDtfsCounter, 5256 mSDsluCounter, 7978 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 2540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5365 SdHoareTripleChecker+Valid, 11359 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2540 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:32:53,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5365 Valid, 11359 Invalid, 3805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2540 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 04:32:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-01-09 04:32:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4251. [2025-01-09 04:32:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 2495 states have (on average 1.2464929859719438) internal successors, (3110), 2746 states have internal predecessors, (3110), 1699 states have call successors, (1699), 55 states have call predecessors, (1699), 56 states have return successors, (1721), 1502 states have call predecessors, (1721), 1698 states have call successors, (1721) [2025-01-09 04:32:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6530 transitions. [2025-01-09 04:32:53,937 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6530 transitions. Word has length 1349 [2025-01-09 04:32:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:32:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6530 transitions. [2025-01-09 04:32:53,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 5 states have internal predecessors, (294), 3 states have call successors, (215), 3 states have call predecessors, (215), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-01-09 04:32:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6530 transitions. [2025-01-09 04:32:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2025-01-09 04:32:53,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:32:53,960 INFO L218 NwaCegarLoop]: trace histogram [210, 210, 210, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:32:53,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:32:53,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:32:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:32:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1477714503, now seen corresponding path program 1 times [2025-01-09 04:32:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:32:53,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963577077] [2025-01-09 04:32:53,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:32:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:32:54,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1400 statements into 1 equivalence classes. [2025-01-09 04:32:54,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1400 of 1400 statements. [2025-01-09 04:32:54,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:32:54,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:32:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 87792 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 87790 trivial. 0 not checked. [2025-01-09 04:32:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:32:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963577077] [2025-01-09 04:32:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963577077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:32:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:32:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:32:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922036014] [2025-01-09 04:32:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:32:57,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:32:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:32:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:32:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:32:57,039 INFO L87 Difference]: Start difference. First operand 4251 states and 6530 transitions. Second operand has 5 states, 4 states have (on average 81.75) internal successors, (327), 5 states have internal predecessors, (327), 4 states have call successors, (220), 2 states have call predecessors, (220), 2 states have return successors, (219), 3 states have call predecessors, (219), 4 states have call successors, (219) [2025-01-09 04:33:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:00,340 INFO L93 Difference]: Finished difference Result 8395 states and 12874 transitions. [2025-01-09 04:33:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:33:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 81.75) internal successors, (327), 5 states have internal predecessors, (327), 4 states have call successors, (220), 2 states have call predecessors, (220), 2 states have return successors, (219), 3 states have call predecessors, (219), 4 states have call successors, (219) Word has length 1400 [2025-01-09 04:33:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:00,390 INFO L225 Difference]: With dead ends: 8395 [2025-01-09 04:33:00,390 INFO L226 Difference]: Without dead ends: 4779 [2025-01-09 04:33:00,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:00,414 INFO L435 NwaCegarLoop]: 3742 mSDtfsCounter, 3750 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3750 SdHoareTripleChecker+Valid, 5871 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:00,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3750 Valid, 5871 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 04:33:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2025-01-09 04:33:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4777. [2025-01-09 04:33:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 2883 states have (on average 1.259105098855359) internal successors, (3630), 3134 states have internal predecessors, (3630), 1823 states have call successors, (1823), 69 states have call predecessors, (1823), 70 states have return successors, (1845), 1626 states have call predecessors, (1845), 1822 states have call successors, (1845) [2025-01-09 04:33:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 7298 transitions. [2025-01-09 04:33:01,109 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 7298 transitions. Word has length 1400 [2025-01-09 04:33:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:01,112 INFO L471 AbstractCegarLoop]: Abstraction has 4777 states and 7298 transitions. [2025-01-09 04:33:01,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 81.75) internal successors, (327), 5 states have internal predecessors, (327), 4 states have call successors, (220), 2 states have call predecessors, (220), 2 states have return successors, (219), 3 states have call predecessors, (219), 4 states have call successors, (219) [2025-01-09 04:33:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7298 transitions. [2025-01-09 04:33:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1405 [2025-01-09 04:33:01,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:01,135 INFO L218 NwaCegarLoop]: trace histogram [210, 210, 210, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:33:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:33:01,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1206805091, now seen corresponding path program 1 times [2025-01-09 04:33:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039900607] [2025-01-09 04:33:01,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:01,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1404 statements into 1 equivalence classes. [2025-01-09 04:33:01,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1404 of 1404 statements. [2025-01-09 04:33:01,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:01,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 87792 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 87784 trivial. 0 not checked. [2025-01-09 04:33:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039900607] [2025-01-09 04:33:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039900607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:33:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787100520] [2025-01-09 04:33:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:33:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:03,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:33:03,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:03,031 INFO L87 Difference]: Start difference. First operand 4777 states and 7298 transitions. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 3 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) [2025-01-09 04:33:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:06,942 INFO L93 Difference]: Finished difference Result 8903 states and 13617 transitions. [2025-01-09 04:33:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:06,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 3 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) Word has length 1404 [2025-01-09 04:33:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:06,985 INFO L225 Difference]: With dead ends: 8903 [2025-01-09 04:33:06,986 INFO L226 Difference]: Without dead ends: 4761 [2025-01-09 04:33:07,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:07,010 INFO L435 NwaCegarLoop]: 3769 mSDtfsCounter, 4591 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4591 SdHoareTripleChecker+Valid, 6291 SdHoareTripleChecker+Invalid, 3906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 896 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:07,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4591 Valid, 6291 Invalid, 3906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [896 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 04:33:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2025-01-09 04:33:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4761. [2025-01-09 04:33:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 2873 states have (on average 1.2572224155934564) internal successors, (3612), 3124 states have internal predecessors, (3612), 1817 states have call successors, (1817), 69 states have call predecessors, (1817), 70 states have return successors, (1839), 1620 states have call predecessors, (1839), 1816 states have call successors, (1839) [2025-01-09 04:33:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 7268 transitions. [2025-01-09 04:33:07,622 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 7268 transitions. Word has length 1404 [2025-01-09 04:33:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:07,624 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 7268 transitions. [2025-01-09 04:33:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 3 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) [2025-01-09 04:33:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 7268 transitions. [2025-01-09 04:33:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2025-01-09 04:33:07,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:07,648 INFO L218 NwaCegarLoop]: trace histogram [210, 210, 210, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:33:07,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:33:07,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:07,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:07,649 INFO L85 PathProgramCache]: Analyzing trace with hash -810587787, now seen corresponding path program 1 times [2025-01-09 04:33:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097839887] [2025-01-09 04:33:07,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:08,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1405 statements into 1 equivalence classes. [2025-01-09 04:33:08,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1405 of 1405 statements. [2025-01-09 04:33:08,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:08,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 87792 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 87785 trivial. 0 not checked. [2025-01-09 04:33:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097839887] [2025-01-09 04:33:09,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097839887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:09,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:33:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656215052] [2025-01-09 04:33:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:09,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:33:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:09,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:33:09,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:09,542 INFO L87 Difference]: Start difference. First operand 4761 states and 7268 transitions. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 3 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220)