./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-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/combinations/pc_sfifo_3.cil+token_ring.03.cil-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 bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:27,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:27,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:06:27,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:27,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:27,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:27,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:27,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:27,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:27,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:27,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:27,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:27,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:27,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:27,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:27,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:27,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:27,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:27,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:27,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:27,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:27,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:27,802 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 -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2025-01-09 06:06:28,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:28,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:28,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:28,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:28,088 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:28,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2025-01-09 06:06:29,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ac2558be/f53abca3f1e1450ea92ed0babbc0b259/FLAGb7c80e090 [2025-01-09 06:06:29,641 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:29,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2025-01-09 06:06:29,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ac2558be/f53abca3f1e1450ea92ed0babbc0b259/FLAGb7c80e090 [2025-01-09 06:06:29,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ac2558be/f53abca3f1e1450ea92ed0babbc0b259 [2025-01-09 06:06:29,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:29,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:29,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:29,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:29,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:29,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:29" (1/1) ... [2025-01-09 06:06:29,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622992b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:29, skipping insertion in model container [2025-01-09 06:06:29,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:29" (1/1) ... [2025-01-09 06:06:30,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:30,155 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/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2025-01-09 06:06:30,222 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/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2025-01-09 06:06:30,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:30,302 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:30,320 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/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2025-01-09 06:06:30,343 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/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2025-01-09 06:06:30,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:30,395 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:30,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30 WrapperNode [2025-01-09 06:06:30,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:30,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:30,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:30,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:30,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,473 INFO L138 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 542 [2025-01-09 06:06:30,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:30,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:30,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:30,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:30,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 06:06:30,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:30,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:30,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:30,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:30,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:30,583 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 06:06:30,587 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 06:06:30,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:30,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:30,604 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:06:30,604 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:06:30,675 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:30,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:31,002 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:06:31,003 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-01-09 06:06:31,105 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:31,105 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:31,125 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:31,125 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 06:06:31,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:31 BoogieIcfgContainer [2025-01-09 06:06:31,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:31,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:31,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:31,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:31,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:29" (1/3) ... [2025-01-09 06:06:31,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a1a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:31, skipping insertion in model container [2025-01-09 06:06:31,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30" (2/3) ... [2025-01-09 06:06:31,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a1a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:31, skipping insertion in model container [2025-01-09 06:06:31,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:31" (3/3) ... [2025-01-09 06:06:31,136 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2025-01-09 06:06:31,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:31,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c that has 16 procedures, 276 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-01-09 06:06:31,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:31,220 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;@3a768be8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:31,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 276 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 231 states have internal predecessors, (346), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 06:06:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:31,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:31,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:31,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:31,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -526705127, now seen corresponding path program 1 times [2025-01-09 06:06:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012089450] [2025-01-09 06:06:31,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:31,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:31,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:31,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:31,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:31,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012089450] [2025-01-09 06:06:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012089450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:31,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828957941] [2025-01-09 06:06:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:31,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:31,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:31,618 INFO L87 Difference]: Start difference. First operand has 276 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 231 states have internal predecessors, (346), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:32,281 INFO L93 Difference]: Finished difference Result 647 states and 981 transitions. [2025-01-09 06:06:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:06:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:32,291 INFO L225 Difference]: With dead ends: 647 [2025-01-09 06:06:32,291 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 06:06:32,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:32,296 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 337 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:32,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 901 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 06:06:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 373. [2025-01-09 06:06:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 301 states have (on average 1.4850498338870433) internal successors, (447), 308 states have internal predecessors, (447), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2025-01-09 06:06:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 544 transitions. [2025-01-09 06:06:32,346 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 544 transitions. Word has length 63 [2025-01-09 06:06:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:32,346 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 544 transitions. [2025-01-09 06:06:32,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 544 transitions. [2025-01-09 06:06:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:32,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:32,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:32,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:06:32,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:32,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1481743577, now seen corresponding path program 1 times [2025-01-09 06:06:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229940936] [2025-01-09 06:06:32,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:32,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:32,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:32,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:32,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:32,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229940936] [2025-01-09 06:06:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229940936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:32,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:32,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:32,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068976246] [2025-01-09 06:06:32,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:32,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:32,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:32,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:32,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:32,559 INFO L87 Difference]: Start difference. First operand 373 states and 544 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:33,131 INFO L93 Difference]: Finished difference Result 728 states and 1047 transitions. [2025-01-09 06:06:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:06:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:33,135 INFO L225 Difference]: With dead ends: 728 [2025-01-09 06:06:33,135 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 06:06:33,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:33,137 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 567 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:33,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 999 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 06:06:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 481. [2025-01-09 06:06:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 396 states have internal predecessors, (569), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2025-01-09 06:06:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 700 transitions. [2025-01-09 06:06:33,196 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 700 transitions. Word has length 63 [2025-01-09 06:06:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 700 transitions. [2025-01-09 06:06:33,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 700 transitions. [2025-01-09 06:06:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:33,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:33,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:06:33,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1466224859, now seen corresponding path program 1 times [2025-01-09 06:06:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:33,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56062516] [2025-01-09 06:06:33,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:33,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:33,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:33,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:33,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56062516] [2025-01-09 06:06:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56062516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:33,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344628958] [2025-01-09 06:06:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:33,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:33,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:33,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:33,273 INFO L87 Difference]: Start difference. First operand 481 states and 700 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:33,613 INFO L93 Difference]: Finished difference Result 1351 states and 1946 transitions. [2025-01-09 06:06:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:06:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:33,623 INFO L225 Difference]: With dead ends: 1351 [2025-01-09 06:06:33,623 INFO L226 Difference]: Without dead ends: 1048 [2025-01-09 06:06:33,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:33,629 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 482 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:33,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 944 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-09 06:06:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1031. [2025-01-09 06:06:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 827 states have (on average 1.423216444981862) internal successors, (1177), 844 states have internal predecessors, (1177), 121 states have call successors, (121), 71 states have call predecessors, (121), 81 states have return successors, (155), 119 states have call predecessors, (155), 117 states have call successors, (155) [2025-01-09 06:06:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1453 transitions. [2025-01-09 06:06:33,731 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1453 transitions. Word has length 63 [2025-01-09 06:06:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:33,731 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1453 transitions. [2025-01-09 06:06:33,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1453 transitions. [2025-01-09 06:06:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:33,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:33,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:33,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:06:33,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1260831460, now seen corresponding path program 1 times [2025-01-09 06:06:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049452722] [2025-01-09 06:06:33,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:33,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:33,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:33,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:33,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:33,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:33,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049452722] [2025-01-09 06:06:33,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049452722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:33,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:33,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058196513] [2025-01-09 06:06:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:33,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:33,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:33,848 INFO L87 Difference]: Start difference. First operand 1031 states and 1453 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:33,948 INFO L93 Difference]: Finished difference Result 1904 states and 2687 transitions. [2025-01-09 06:06:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:33,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 06:06:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:33,952 INFO L225 Difference]: With dead ends: 1904 [2025-01-09 06:06:33,952 INFO L226 Difference]: Without dead ends: 1051 [2025-01-09 06:06:33,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:33,955 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 0 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:33,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1929 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-01-09 06:06:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-01-09 06:06:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 843 states have (on average 1.4092526690391458) internal successors, (1188), 860 states have internal predecessors, (1188), 121 states have call successors, (121), 71 states have call predecessors, (121), 85 states have return successors, (162), 123 states have call predecessors, (162), 117 states have call successors, (162) [2025-01-09 06:06:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1471 transitions. [2025-01-09 06:06:34,009 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1471 transitions. Word has length 64 [2025-01-09 06:06:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:34,010 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1471 transitions. [2025-01-09 06:06:34,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1471 transitions. [2025-01-09 06:06:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:34,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:34,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:34,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:06:34,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:34,012 INFO L85 PathProgramCache]: Analyzing trace with hash 866464674, now seen corresponding path program 1 times [2025-01-09 06:06:34,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:34,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450119931] [2025-01-09 06:06:34,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:34,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:34,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:34,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450119931] [2025-01-09 06:06:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450119931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:34,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:34,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782935449] [2025-01-09 06:06:34,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:34,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:34,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:34,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:34,106 INFO L87 Difference]: Start difference. First operand 1051 states and 1471 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:34,641 INFO L93 Difference]: Finished difference Result 3513 states and 4908 transitions. [2025-01-09 06:06:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-01-09 06:06:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:34,651 INFO L225 Difference]: With dead ends: 3513 [2025-01-09 06:06:34,651 INFO L226 Difference]: Without dead ends: 1341 [2025-01-09 06:06:34,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:34,657 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1283 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:34,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 1797 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-01-09 06:06:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 976. [2025-01-09 06:06:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 768 states have (on average 1.3723958333333333) internal successors, (1054), 785 states have internal predecessors, (1054), 121 states have call successors, (121), 71 states have call predecessors, (121), 85 states have return successors, (150), 123 states have call predecessors, (150), 117 states have call successors, (150) [2025-01-09 06:06:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1325 transitions. [2025-01-09 06:06:34,732 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1325 transitions. Word has length 64 [2025-01-09 06:06:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:34,734 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1325 transitions. [2025-01-09 06:06:34,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1325 transitions. [2025-01-09 06:06:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:34,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:34,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:06:34,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1630100746, now seen corresponding path program 1 times [2025-01-09 06:06:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753979916] [2025-01-09 06:06:34,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:34,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:34,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:34,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753979916] [2025-01-09 06:06:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753979916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:06:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053908129] [2025-01-09 06:06:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:34,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:06:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:34,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:06:34,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:34,842 INFO L87 Difference]: Start difference. First operand 976 states and 1325 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,376 INFO L93 Difference]: Finished difference Result 2055 states and 2771 transitions. [2025-01-09 06:06:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-01-09 06:06:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,378 INFO L225 Difference]: With dead ends: 2055 [2025-01-09 06:06:35,378 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 06:06:35,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:06:35,382 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 695 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:35,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1035 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 06:06:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-01-09 06:06:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 132 states have (on average 1.5227272727272727) internal successors, (201), 134 states have internal predecessors, (201), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 06:06:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2025-01-09 06:06:35,393 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 65 [2025-01-09 06:06:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:35,393 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2025-01-09 06:06:35,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2025-01-09 06:06:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:35,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:35,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:35,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:06:35,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -110580059, now seen corresponding path program 1 times [2025-01-09 06:06:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:35,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878591442] [2025-01-09 06:06:35,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:35,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:35,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:35,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:35,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878591442] [2025-01-09 06:06:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878591442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:35,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257249207] [2025-01-09 06:06:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:35,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:35,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:35,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:35,447 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,703 INFO L93 Difference]: Finished difference Result 462 states and 701 transitions. [2025-01-09 06:06:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,705 INFO L225 Difference]: With dead ends: 462 [2025-01-09 06:06:35,705 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 06:06:35,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:35,706 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 399 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:35,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 633 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 06:06:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 303. [2025-01-09 06:06:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 258 states have (on average 1.5348837209302326) internal successors, (396), 261 states have internal predecessors, (396), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-01-09 06:06:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 457 transitions. [2025-01-09 06:06:35,718 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 457 transitions. Word has length 78 [2025-01-09 06:06:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:35,718 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 457 transitions. [2025-01-09 06:06:35,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 457 transitions. [2025-01-09 06:06:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:35,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:35,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:35,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:06:35,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:35,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash -102933343, now seen corresponding path program 1 times [2025-01-09 06:06:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591467142] [2025-01-09 06:06:35,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:35,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:35,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:35,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:35,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:35,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591467142] [2025-01-09 06:06:35,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591467142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:35,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:35,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785548346] [2025-01-09 06:06:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:35,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:35,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:35,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:35,823 INFO L87 Difference]: Start difference. First operand 303 states and 457 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:36,139 INFO L93 Difference]: Finished difference Result 775 states and 1178 transitions. [2025-01-09 06:06:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:36,142 INFO L225 Difference]: With dead ends: 775 [2025-01-09 06:06:36,142 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 06:06:36,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:36,144 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 390 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:36,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1184 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 06:06:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 439. [2025-01-09 06:06:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 375 states have (on average 1.528) internal successors, (573), 379 states have internal predecessors, (573), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-01-09 06:06:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 661 transitions. [2025-01-09 06:06:36,160 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 661 transitions. Word has length 78 [2025-01-09 06:06:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:36,161 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 661 transitions. [2025-01-09 06:06:36,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 661 transitions. [2025-01-09 06:06:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:36,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:36,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:06:36,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash -520329949, now seen corresponding path program 1 times [2025-01-09 06:06:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381696711] [2025-01-09 06:06:36,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:36,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:36,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:36,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381696711] [2025-01-09 06:06:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381696711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:36,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551906082] [2025-01-09 06:06:36,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:36,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:36,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:36,231 INFO L87 Difference]: Start difference. First operand 439 states and 661 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:36,583 INFO L93 Difference]: Finished difference Result 1199 states and 1821 transitions. [2025-01-09 06:06:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:36,588 INFO L225 Difference]: With dead ends: 1199 [2025-01-09 06:06:36,588 INFO L226 Difference]: Without dead ends: 772 [2025-01-09 06:06:36,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:36,590 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 385 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:36,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1168 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-01-09 06:06:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 724. [2025-01-09 06:06:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 620 states have (on average 1.5258064516129033) internal successors, (946), 628 states have internal predecessors, (946), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 06:06:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1094 transitions. [2025-01-09 06:06:36,634 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1094 transitions. Word has length 78 [2025-01-09 06:06:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:36,635 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1094 transitions. [2025-01-09 06:06:36,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1094 transitions. [2025-01-09 06:06:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:36,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:36,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:06:36,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash 158942305, now seen corresponding path program 1 times [2025-01-09 06:06:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046521037] [2025-01-09 06:06:36,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:36,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:36,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:36,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046521037] [2025-01-09 06:06:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046521037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775355980] [2025-01-09 06:06:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:36,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:36,706 INFO L87 Difference]: Start difference. First operand 724 states and 1094 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:36,870 INFO L93 Difference]: Finished difference Result 1502 states and 2297 transitions. [2025-01-09 06:06:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:36,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:36,875 INFO L225 Difference]: With dead ends: 1502 [2025-01-09 06:06:36,875 INFO L226 Difference]: Without dead ends: 790 [2025-01-09 06:06:36,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:36,877 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 292 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:36,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 438 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-01-09 06:06:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 724. [2025-01-09 06:06:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 620 states have (on average 1.517741935483871) internal successors, (941), 628 states have internal predecessors, (941), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 06:06:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1089 transitions. [2025-01-09 06:06:36,928 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1089 transitions. Word has length 78 [2025-01-09 06:06:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:36,928 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1089 transitions. [2025-01-09 06:06:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1089 transitions. [2025-01-09 06:06:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:36,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:06:36,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2120516963, now seen corresponding path program 1 times [2025-01-09 06:06:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386074896] [2025-01-09 06:06:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:36,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:36,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:36,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:36,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386074896] [2025-01-09 06:06:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386074896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:36,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621863601] [2025-01-09 06:06:36,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:36,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:36,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:36,987 INFO L87 Difference]: Start difference. First operand 724 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,159 INFO L93 Difference]: Finished difference Result 1491 states and 2265 transitions. [2025-01-09 06:06:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,164 INFO L225 Difference]: With dead ends: 1491 [2025-01-09 06:06:37,164 INFO L226 Difference]: Without dead ends: 779 [2025-01-09 06:06:37,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:37,167 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 287 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 428 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-01-09 06:06:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 724. [2025-01-09 06:06:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 620 states have (on average 1.5096774193548388) internal successors, (936), 628 states have internal predecessors, (936), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 06:06:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1084 transitions. [2025-01-09 06:06:37,224 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1084 transitions. Word has length 78 [2025-01-09 06:06:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,224 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1084 transitions. [2025-01-09 06:06:37,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1084 transitions. [2025-01-09 06:06:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:37,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:37,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:06:37,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1972626399, now seen corresponding path program 1 times [2025-01-09 06:06:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154071217] [2025-01-09 06:06:37,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:37,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:37,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154071217] [2025-01-09 06:06:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154071217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199565936] [2025-01-09 06:06:37,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:37,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:37,313 INFO L87 Difference]: Start difference. First operand 724 states and 1084 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,717 INFO L93 Difference]: Finished difference Result 2134 states and 3219 transitions. [2025-01-09 06:06:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:37,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,724 INFO L225 Difference]: With dead ends: 2134 [2025-01-09 06:06:37,725 INFO L226 Difference]: Without dead ends: 1422 [2025-01-09 06:06:37,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:37,727 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 437 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1101 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-01-09 06:06:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1261. [2025-01-09 06:06:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1075 states have (on average 1.495813953488372) internal successors, (1608), 1097 states have internal predecessors, (1608), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-01-09 06:06:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1892 transitions. [2025-01-09 06:06:37,800 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1892 transitions. Word has length 78 [2025-01-09 06:06:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,800 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1892 transitions. [2025-01-09 06:06:37,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1892 transitions. [2025-01-09 06:06:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:37,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:37,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:06:37,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1411926621, now seen corresponding path program 1 times [2025-01-09 06:06:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451146264] [2025-01-09 06:06:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:37,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:37,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451146264] [2025-01-09 06:06:37,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451146264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:37,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574688207] [2025-01-09 06:06:37,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:37,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:37,871 INFO L87 Difference]: Start difference. First operand 1261 states and 1892 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,119 INFO L93 Difference]: Finished difference Result 2568 states and 3879 transitions. [2025-01-09 06:06:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,128 INFO L225 Difference]: With dead ends: 2568 [2025-01-09 06:06:38,128 INFO L226 Difference]: Without dead ends: 1319 [2025-01-09 06:06:38,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:38,134 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 283 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 402 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-01-09 06:06:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1261. [2025-01-09 06:06:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1075 states have (on average 1.4874418604651163) internal successors, (1599), 1097 states have internal predecessors, (1599), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-01-09 06:06:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1883 transitions. [2025-01-09 06:06:38,234 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1883 transitions. Word has length 78 [2025-01-09 06:06:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,234 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1883 transitions. [2025-01-09 06:06:38,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1883 transitions. [2025-01-09 06:06:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:38,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:06:38,238 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash -151009371, now seen corresponding path program 1 times [2025-01-09 06:06:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020860205] [2025-01-09 06:06:38,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:38,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:38,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020860205] [2025-01-09 06:06:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020860205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914773832] [2025-01-09 06:06:38,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:38,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:38,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:38,309 INFO L87 Difference]: Start difference. First operand 1261 states and 1883 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,376 INFO L93 Difference]: Finished difference Result 2536 states and 3834 transitions. [2025-01-09 06:06:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,382 INFO L225 Difference]: With dead ends: 2536 [2025-01-09 06:06:38,383 INFO L226 Difference]: Without dead ends: 1288 [2025-01-09 06:06:38,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:38,387 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 918 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-01-09 06:06:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2025-01-09 06:06:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1102 states have (on average 1.4754990925589837) internal successors, (1626), 1124 states have internal predecessors, (1626), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-01-09 06:06:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1910 transitions. [2025-01-09 06:06:38,455 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1910 transitions. Word has length 78 [2025-01-09 06:06:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,455 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1910 transitions. [2025-01-09 06:06:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1910 transitions. [2025-01-09 06:06:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:38,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:38,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:06:38,457 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1788152675, now seen corresponding path program 1 times [2025-01-09 06:06:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908855382] [2025-01-09 06:06:38,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:38,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:38,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908855382] [2025-01-09 06:06:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908855382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:38,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032489370] [2025-01-09 06:06:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:38,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:38,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:38,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:38,523 INFO L87 Difference]: Start difference. First operand 1288 states and 1910 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,739 INFO L93 Difference]: Finished difference Result 3792 states and 5661 transitions. [2025-01-09 06:06:38,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:38,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,756 INFO L225 Difference]: With dead ends: 3792 [2025-01-09 06:06:38,756 INFO L226 Difference]: Without dead ends: 2517 [2025-01-09 06:06:38,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:38,764 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 404 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 789 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2025-01-09 06:06:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2504. [2025-01-09 06:06:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2148 states have (on average 1.4692737430167597) internal successors, (3156), 2190 states have internal predecessors, (3156), 207 states have call successors, (207), 109 states have call predecessors, (207), 148 states have return successors, (326), 212 states have call predecessors, (326), 205 states have call successors, (326) [2025-01-09 06:06:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3689 transitions. [2025-01-09 06:06:39,019 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3689 transitions. Word has length 78 [2025-01-09 06:06:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,020 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3689 transitions. [2025-01-09 06:06:39,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3689 transitions. [2025-01-09 06:06:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:39,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:39,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:06:39,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash 480147906, now seen corresponding path program 1 times [2025-01-09 06:06:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880551043] [2025-01-09 06:06:39,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:39,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:39,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880551043] [2025-01-09 06:06:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880551043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219190349] [2025-01-09 06:06:39,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:39,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:39,076 INFO L87 Difference]: Start difference. First operand 2504 states and 3689 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,255 INFO L93 Difference]: Finished difference Result 5022 states and 7488 transitions. [2025-01-09 06:06:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,267 INFO L225 Difference]: With dead ends: 5022 [2025-01-09 06:06:39,267 INFO L226 Difference]: Without dead ends: 2531 [2025-01-09 06:06:39,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:39,275 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 918 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2025-01-09 06:06:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2025-01-09 06:06:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2175 states have (on average 1.4593103448275861) internal successors, (3174), 2217 states have internal predecessors, (3174), 207 states have call successors, (207), 109 states have call predecessors, (207), 148 states have return successors, (326), 212 states have call predecessors, (326), 205 states have call successors, (326) [2025-01-09 06:06:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3707 transitions. [2025-01-09 06:06:39,451 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3707 transitions. Word has length 78 [2025-01-09 06:06:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,452 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3707 transitions. [2025-01-09 06:06:39,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3707 transitions. [2025-01-09 06:06:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:39,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:39,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:06:39,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash 728294400, now seen corresponding path program 1 times [2025-01-09 06:06:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228269644] [2025-01-09 06:06:39,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:39,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:39,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228269644] [2025-01-09 06:06:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228269644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060535462] [2025-01-09 06:06:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:39,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:39,525 INFO L87 Difference]: Start difference. First operand 2531 states and 3707 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,626 INFO L93 Difference]: Finished difference Result 5103 states and 7560 transitions. [2025-01-09 06:06:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,639 INFO L225 Difference]: With dead ends: 5103 [2025-01-09 06:06:39,639 INFO L226 Difference]: Without dead ends: 2585 [2025-01-09 06:06:39,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:39,646 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 918 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-01-09 06:06:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2585. [2025-01-09 06:06:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2229 states have (on average 1.4481830417227457) internal successors, (3228), 2271 states have internal predecessors, (3228), 207 states have call successors, (207), 109 states have call predecessors, (207), 148 states have return successors, (326), 212 states have call predecessors, (326), 205 states have call successors, (326) [2025-01-09 06:06:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3761 transitions. [2025-01-09 06:06:39,817 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3761 transitions. Word has length 78 [2025-01-09 06:06:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,817 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 3761 transitions. [2025-01-09 06:06:39,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3761 transitions. [2025-01-09 06:06:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:39,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:39,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:06:39,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash 333927614, now seen corresponding path program 1 times [2025-01-09 06:06:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417504879] [2025-01-09 06:06:39,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:39,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:39,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417504879] [2025-01-09 06:06:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417504879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652717179] [2025-01-09 06:06:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:39,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:39,865 INFO L87 Difference]: Start difference. First operand 2585 states and 3761 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,169 INFO L93 Difference]: Finished difference Result 7638 states and 11184 transitions. [2025-01-09 06:06:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:40,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,192 INFO L225 Difference]: With dead ends: 7638 [2025-01-09 06:06:40,192 INFO L226 Difference]: Without dead ends: 5066 [2025-01-09 06:06:40,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:40,201 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 416 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 789 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2025-01-09 06:06:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 5044. [2025-01-09 06:06:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5044 states, 4357 states have (on average 1.4411292173513885) internal successors, (6279), 4439 states have internal predecessors, (6279), 390 states have call successors, (390), 217 states have call predecessors, (390), 296 states have return successors, (623), 395 states have call predecessors, (623), 388 states have call successors, (623) [2025-01-09 06:06:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 7292 transitions. [2025-01-09 06:06:40,503 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 7292 transitions. Word has length 78 [2025-01-09 06:06:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,504 INFO L471 AbstractCegarLoop]: Abstraction has 5044 states and 7292 transitions. [2025-01-09 06:06:40,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 7292 transitions. [2025-01-09 06:06:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:40,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:40,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:06:40,506 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1294722659, now seen corresponding path program 1 times [2025-01-09 06:06:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634790669] [2025-01-09 06:06:40,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634790669] [2025-01-09 06:06:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634790669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604754385] [2025-01-09 06:06:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:40,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:40,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:40,561 INFO L87 Difference]: Start difference. First operand 5044 states and 7292 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,894 INFO L93 Difference]: Finished difference Result 10129 states and 14805 transitions. [2025-01-09 06:06:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,929 INFO L225 Difference]: With dead ends: 10129 [2025-01-09 06:06:40,929 INFO L226 Difference]: Without dead ends: 5098 [2025-01-09 06:06:40,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:40,943 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 918 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2025-01-09 06:06:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5098. [2025-01-09 06:06:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5098 states, 4411 states have (on average 1.4316481523464066) internal successors, (6315), 4493 states have internal predecessors, (6315), 390 states have call successors, (390), 217 states have call predecessors, (390), 296 states have return successors, (623), 395 states have call predecessors, (623), 388 states have call successors, (623) [2025-01-09 06:06:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 7328 transitions. [2025-01-09 06:06:41,291 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 7328 transitions. Word has length 78 [2025-01-09 06:06:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:41,292 INFO L471 AbstractCegarLoop]: Abstraction has 5098 states and 7328 transitions. [2025-01-09 06:06:41,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 7328 transitions. [2025-01-09 06:06:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:41,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:41,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:06:41,294 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1272090405, now seen corresponding path program 1 times [2025-01-09 06:06:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185965157] [2025-01-09 06:06:41,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:41,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:41,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:41,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:41,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185965157] [2025-01-09 06:06:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185965157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430921128] [2025-01-09 06:06:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:41,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:41,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:41,391 INFO L87 Difference]: Start difference. First operand 5098 states and 7328 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:41,774 INFO L93 Difference]: Finished difference Result 6554 states and 9458 transitions. [2025-01-09 06:06:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:41,793 INFO L225 Difference]: With dead ends: 6554 [2025-01-09 06:06:41,793 INFO L226 Difference]: Without dead ends: 3574 [2025-01-09 06:06:41,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:41,802 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 373 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:41,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 790 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2025-01-09 06:06:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3286. [2025-01-09 06:06:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 2851 states have (on average 1.4138898632058927) internal successors, (4031), 2877 states have internal predecessors, (4031), 266 states have call successors, (266), 145 states have call predecessors, (266), 168 states have return successors, (319), 267 states have call predecessors, (319), 264 states have call successors, (319) [2025-01-09 06:06:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4616 transitions. [2025-01-09 06:06:42,012 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4616 transitions. Word has length 78 [2025-01-09 06:06:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,012 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 4616 transitions. [2025-01-09 06:06:42,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4616 transitions. [2025-01-09 06:06:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:42,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:42,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:06:42,016 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1131541795, now seen corresponding path program 1 times [2025-01-09 06:06:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484998215] [2025-01-09 06:06:42,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:42,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:42,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484998215] [2025-01-09 06:06:42,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484998215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560101826] [2025-01-09 06:06:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:42,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:42,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:42,112 INFO L87 Difference]: Start difference. First operand 3286 states and 4616 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,446 INFO L93 Difference]: Finished difference Result 4606 states and 6522 transitions. [2025-01-09 06:06:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,458 INFO L225 Difference]: With dead ends: 4606 [2025-01-09 06:06:42,458 INFO L226 Difference]: Without dead ends: 2350 [2025-01-09 06:06:42,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:42,463 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 365 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 782 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-01-09 06:06:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2198. [2025-01-09 06:06:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 1911 states have (on average 1.414442700156986) internal successors, (2703), 1921 states have internal predecessors, (2703), 182 states have call successors, (182), 97 states have call predecessors, (182), 104 states have return successors, (193), 181 states have call predecessors, (193), 180 states have call successors, (193) [2025-01-09 06:06:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3078 transitions. [2025-01-09 06:06:42,557 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3078 transitions. Word has length 78 [2025-01-09 06:06:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,557 INFO L471 AbstractCegarLoop]: Abstraction has 2198 states and 3078 transitions. [2025-01-09 06:06:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3078 transitions. [2025-01-09 06:06:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:42,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:42,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:06:42,560 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1265555301, now seen corresponding path program 1 times [2025-01-09 06:06:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644465357] [2025-01-09 06:06:42,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:42,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:42,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644465357] [2025-01-09 06:06:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644465357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971109560] [2025-01-09 06:06:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:42,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:42,629 INFO L87 Difference]: Start difference. First operand 2198 states and 3078 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,821 INFO L93 Difference]: Finished difference Result 4382 states and 6163 transitions. [2025-01-09 06:06:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,831 INFO L225 Difference]: With dead ends: 4382 [2025-01-09 06:06:42,831 INFO L226 Difference]: Without dead ends: 2198 [2025-01-09 06:06:42,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:42,837 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 277 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 403 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2025-01-09 06:06:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2198. [2025-01-09 06:06:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 1911 states have (on average 1.3997906855049713) internal successors, (2675), 1921 states have internal predecessors, (2675), 182 states have call successors, (182), 97 states have call predecessors, (182), 104 states have return successors, (193), 181 states have call predecessors, (193), 180 states have call successors, (193) [2025-01-09 06:06:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3050 transitions. [2025-01-09 06:06:42,966 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3050 transitions. Word has length 78 [2025-01-09 06:06:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,967 INFO L471 AbstractCegarLoop]: Abstraction has 2198 states and 3050 transitions. [2025-01-09 06:06:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3050 transitions. [2025-01-09 06:06:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:42,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:42,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:06:42,968 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1223973661, now seen corresponding path program 1 times [2025-01-09 06:06:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487824470] [2025-01-09 06:06:42,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:42,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:42,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487824470] [2025-01-09 06:06:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487824470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:43,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:43,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:43,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008160355] [2025-01-09 06:06:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:43,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:43,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:43,032 INFO L87 Difference]: Start difference. First operand 2198 states and 3050 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:43,316 INFO L93 Difference]: Finished difference Result 4943 states and 6879 transitions. [2025-01-09 06:06:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:43,327 INFO L225 Difference]: With dead ends: 4943 [2025-01-09 06:06:43,327 INFO L226 Difference]: Without dead ends: 2758 [2025-01-09 06:06:43,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:43,333 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 345 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:43,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 402 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2025-01-09 06:06:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2494. [2025-01-09 06:06:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2183 states have (on average 1.3609711406321576) internal successors, (2971), 2193 states have internal predecessors, (2971), 190 states have call successors, (190), 113 states have call predecessors, (190), 120 states have return successors, (217), 189 states have call predecessors, (217), 188 states have call successors, (217) [2025-01-09 06:06:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3378 transitions. [2025-01-09 06:06:43,441 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3378 transitions. Word has length 78 [2025-01-09 06:06:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:43,442 INFO L471 AbstractCegarLoop]: Abstraction has 2494 states and 3378 transitions. [2025-01-09 06:06:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3378 transitions. [2025-01-09 06:06:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:43,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:43,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:43,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:06:43,442 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:43,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1442828379, now seen corresponding path program 1 times [2025-01-09 06:06:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:43,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012573511] [2025-01-09 06:06:43,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:43,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:43,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:43,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:43,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012573511] [2025-01-09 06:06:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012573511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556287245] [2025-01-09 06:06:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:43,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:43,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:43,532 INFO L87 Difference]: Start difference. First operand 2494 states and 3378 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:44,006 INFO L93 Difference]: Finished difference Result 4660 states and 6352 transitions. [2025-01-09 06:06:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:44,018 INFO L225 Difference]: With dead ends: 4660 [2025-01-09 06:06:44,018 INFO L226 Difference]: Without dead ends: 2730 [2025-01-09 06:06:44,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:44,025 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 358 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:44,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 737 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2025-01-09 06:06:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2478. [2025-01-09 06:06:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2171 states have (on average 1.3574389682174113) internal successors, (2947), 2177 states have internal predecessors, (2947), 190 states have call successors, (190), 113 states have call predecessors, (190), 116 states have return successors, (208), 188 states have call predecessors, (208), 188 states have call successors, (208) [2025-01-09 06:06:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3345 transitions. [2025-01-09 06:06:44,218 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3345 transitions. Word has length 78 [2025-01-09 06:06:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:44,219 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3345 transitions. [2025-01-09 06:06:44,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3345 transitions. [2025-01-09 06:06:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:44,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:44,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:44,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:06:44,220 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1865530205, now seen corresponding path program 1 times [2025-01-09 06:06:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776707175] [2025-01-09 06:06:44,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:44,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:44,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:44,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:44,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:44,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776707175] [2025-01-09 06:06:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776707175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858753380] [2025-01-09 06:06:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:44,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:44,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:44,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:44,321 INFO L87 Difference]: Start difference. First operand 2478 states and 3345 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:44,906 INFO L93 Difference]: Finished difference Result 6420 states and 8593 transitions. [2025-01-09 06:06:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 06:06:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:44,921 INFO L225 Difference]: With dead ends: 6420 [2025-01-09 06:06:44,921 INFO L226 Difference]: Without dead ends: 3956 [2025-01-09 06:06:44,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:44,928 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 351 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:44,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 748 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2025-01-09 06:06:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3640. [2025-01-09 06:06:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3640 states, 3183 states have (on average 1.3399308828149545) internal successors, (4265), 3197 states have internal predecessors, (4265), 276 states have call successors, (276), 169 states have call predecessors, (276), 180 states have return successors, (319), 275 states have call predecessors, (319), 274 states have call successors, (319) [2025-01-09 06:06:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 4860 transitions. [2025-01-09 06:06:45,182 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 4860 transitions. Word has length 78 [2025-01-09 06:06:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 3640 states and 4860 transitions. [2025-01-09 06:06:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 4860 transitions. [2025-01-09 06:06:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 06:06:45,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:45,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:06:45,183 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:45,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1047881755, now seen corresponding path program 1 times [2025-01-09 06:06:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084005010] [2025-01-09 06:06:45,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:45,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 06:06:45,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 06:06:45,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:45,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084005010] [2025-01-09 06:06:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084005010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:45,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916003587] [2025-01-09 06:06:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:45,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:45,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:45,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:45,206 INFO L87 Difference]: Start difference. First operand 3640 states and 4860 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 06:06:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:45,411 INFO L93 Difference]: Finished difference Result 8794 states and 11823 transitions. [2025-01-09 06:06:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2025-01-09 06:06:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:45,428 INFO L225 Difference]: With dead ends: 8794 [2025-01-09 06:06:45,429 INFO L226 Difference]: Without dead ends: 5168 [2025-01-09 06:06:45,434 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 06:06:45,435 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 186 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:45,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 431 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2025-01-09 06:06:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 5152. [2025-01-09 06:06:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5152 states, 4507 states have (on average 1.3292655868648768) internal successors, (5991), 4541 states have internal predecessors, (5991), 388 states have call successors, (388), 241 states have call predecessors, (388), 256 states have return successors, (427), 371 states have call predecessors, (427), 386 states have call successors, (427) [2025-01-09 06:06:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 6806 transitions. [2025-01-09 06:06:45,645 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 6806 transitions. Word has length 78 [2025-01-09 06:06:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:45,646 INFO L471 AbstractCegarLoop]: Abstraction has 5152 states and 6806 transitions. [2025-01-09 06:06:45,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 06:06:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 6806 transitions. [2025-01-09 06:06:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 06:06:45,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:45,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:06:45,651 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash -817454570, now seen corresponding path program 1 times [2025-01-09 06:06:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81510327] [2025-01-09 06:06:45,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:45,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 06:06:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 06:06:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 06:06:45,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81510327] [2025-01-09 06:06:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81510327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327039162] [2025-01-09 06:06:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:45,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:45,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:45,742 INFO L87 Difference]: Start difference. First operand 5152 states and 6806 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:46,296 INFO L93 Difference]: Finished difference Result 15844 states and 21034 transitions. [2025-01-09 06:06:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:46,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 126 [2025-01-09 06:06:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:46,324 INFO L225 Difference]: With dead ends: 15844 [2025-01-09 06:06:46,325 INFO L226 Difference]: Without dead ends: 10708 [2025-01-09 06:06:46,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:46,334 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 304 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:46,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 553 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10708 states. [2025-01-09 06:06:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10708 to 10680. [2025-01-09 06:06:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10680 states, 9350 states have (on average 1.3114438502673798) internal successors, (12262), 9445 states have internal predecessors, (12262), 761 states have call successors, (761), 481 states have call predecessors, (761), 568 states have return successors, (1045), 757 states have call predecessors, (1045), 759 states have call successors, (1045) [2025-01-09 06:06:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10680 states to 10680 states and 14068 transitions. [2025-01-09 06:06:46,785 INFO L78 Accepts]: Start accepts. Automaton has 10680 states and 14068 transitions. Word has length 126 [2025-01-09 06:06:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:46,785 INFO L471 AbstractCegarLoop]: Abstraction has 10680 states and 14068 transitions. [2025-01-09 06:06:46,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10680 states and 14068 transitions. [2025-01-09 06:06:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 06:06:46,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:46,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:46,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:06:46,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:46,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1755510040, now seen corresponding path program 1 times [2025-01-09 06:06:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:46,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937647595] [2025-01-09 06:06:46,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:46,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:46,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 06:06:46,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 06:06:46,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:46,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 06:06:46,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:46,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937647595] [2025-01-09 06:06:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937647595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:46,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558144914] [2025-01-09 06:06:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:46,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:46,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:46,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:46,821 INFO L87 Difference]: Start difference. First operand 10680 states and 14068 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:47,161 INFO L93 Difference]: Finished difference Result 18924 states and 24891 transitions. [2025-01-09 06:06:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 126 [2025-01-09 06:06:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:47,191 INFO L225 Difference]: With dead ends: 18924 [2025-01-09 06:06:47,191 INFO L226 Difference]: Without dead ends: 8260 [2025-01-09 06:06:47,208 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 06:06:47,209 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 222 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:47,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 229 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8260 states. [2025-01-09 06:06:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8260 to 8260. [2025-01-09 06:06:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8260 states, 7247 states have (on average 1.3095073823651167) internal successors, (9490), 7325 states have internal predecessors, (9490), 572 states have call successors, (572), 361 states have call predecessors, (572), 440 states have return successors, (787), 575 states have call predecessors, (787), 570 states have call successors, (787) [2025-01-09 06:06:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8260 states to 8260 states and 10849 transitions. [2025-01-09 06:06:47,600 INFO L78 Accepts]: Start accepts. Automaton has 8260 states and 10849 transitions. Word has length 126 [2025-01-09 06:06:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 8260 states and 10849 transitions. [2025-01-09 06:06:47,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8260 states and 10849 transitions. [2025-01-09 06:06:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 06:06:47,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:47,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:47,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 06:06:47,607 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:47,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash 22619637, now seen corresponding path program 1 times [2025-01-09 06:06:47,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:47,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29178533] [2025-01-09 06:06:47,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:47,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 06:06:47,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 06:06:47,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:47,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 06:06:47,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29178533] [2025-01-09 06:06:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29178533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:47,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:47,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293624261] [2025-01-09 06:06:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:47,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:47,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:47,686 INFO L87 Difference]: Start difference. First operand 8260 states and 10849 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:48,956 INFO L93 Difference]: Finished difference Result 25825 states and 33853 transitions. [2025-01-09 06:06:48,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:48,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 128 [2025-01-09 06:06:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:49,015 INFO L225 Difference]: With dead ends: 25825 [2025-01-09 06:06:49,015 INFO L226 Difference]: Without dead ends: 17581 [2025-01-09 06:06:49,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:49,034 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 288 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:49,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 528 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17581 states. [2025-01-09 06:06:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17581 to 17453. [2025-01-09 06:06:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17453 states, 15291 states have (on average 1.2927212085540514) internal successors, (19767), 15558 states have internal predecessors, (19767), 1083 states have call successors, (1083), 711 states have call predecessors, (1083), 1078 states have return successors, (1941), 1187 states have call predecessors, (1941), 1081 states have call successors, (1941) [2025-01-09 06:06:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17453 states to 17453 states and 22791 transitions. [2025-01-09 06:06:50,055 INFO L78 Accepts]: Start accepts. Automaton has 17453 states and 22791 transitions. Word has length 128 [2025-01-09 06:06:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:50,056 INFO L471 AbstractCegarLoop]: Abstraction has 17453 states and 22791 transitions. [2025-01-09 06:06:50,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17453 states and 22791 transitions. [2025-01-09 06:06:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 06:06:50,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:50,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:50,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 06:06:50,067 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:50,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1819856077, now seen corresponding path program 1 times [2025-01-09 06:06:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:50,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065148560] [2025-01-09 06:06:50,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:50,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 06:06:50,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 06:06:50,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 06:06:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065148560] [2025-01-09 06:06:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065148560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878498551] [2025-01-09 06:06:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:50,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:50,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:50,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:50,093 INFO L87 Difference]: Start difference. First operand 17453 states and 22791 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:50,880 INFO L93 Difference]: Finished difference Result 34885 states and 45544 transitions. [2025-01-09 06:06:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 128 [2025-01-09 06:06:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:50,937 INFO L225 Difference]: With dead ends: 34885 [2025-01-09 06:06:50,937 INFO L226 Difference]: Without dead ends: 17446 [2025-01-09 06:06:50,960 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 06:06:50,960 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 220 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:50,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17446 states. [2025-01-09 06:06:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17446 to 17446. [2025-01-09 06:06:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17446 states, 15289 states have (on average 1.2926286872915167) internal successors, (19763), 15555 states have internal predecessors, (19763), 1078 states have call successors, (1078), 711 states have call predecessors, (1078), 1078 states have return successors, (1933), 1181 states have call predecessors, (1933), 1076 states have call successors, (1933) [2025-01-09 06:06:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 22774 transitions. [2025-01-09 06:06:51,905 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 22774 transitions. Word has length 128 [2025-01-09 06:06:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 17446 states and 22774 transitions. [2025-01-09 06:06:51,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 22774 transitions. [2025-01-09 06:06:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:51,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 06:06:51,915 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2136470378, now seen corresponding path program 1 times [2025-01-09 06:06:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370124699] [2025-01-09 06:06:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:51,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:51,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:51,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:51,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 06:06:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370124699] [2025-01-09 06:06:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370124699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967798374] [2025-01-09 06:06:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:51,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:51,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:51,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:51,977 INFO L87 Difference]: Start difference. First operand 17446 states and 22774 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:54,453 INFO L93 Difference]: Finished difference Result 49838 states and 65262 transitions. [2025-01-09 06:06:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 130 [2025-01-09 06:06:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:54,575 INFO L225 Difference]: With dead ends: 49838 [2025-01-09 06:06:54,575 INFO L226 Difference]: Without dead ends: 32408 [2025-01-09 06:06:54,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:54,618 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 279 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:54,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 532 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32408 states. [2025-01-09 06:06:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32408 to 31924. [2025-01-09 06:06:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31924 states, 27675 states have (on average 1.2888527551942186) internal successors, (35669), 28278 states have internal predecessors, (35669), 2057 states have call successors, (2057), 1325 states have call predecessors, (2057), 2191 states have return successors, (4144), 2324 states have call predecessors, (4144), 2055 states have call successors, (4144) [2025-01-09 06:06:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31924 states to 31924 states and 41870 transitions. [2025-01-09 06:06:56,491 INFO L78 Accepts]: Start accepts. Automaton has 31924 states and 41870 transitions. Word has length 130 [2025-01-09 06:06:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 31924 states and 41870 transitions. [2025-01-09 06:06:56,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31924 states and 41870 transitions. [2025-01-09 06:06:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:56,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:56,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:56,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 06:06:56,507 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:56,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash 876324632, now seen corresponding path program 1 times [2025-01-09 06:06:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:56,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732151865] [2025-01-09 06:06:56,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:56,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:56,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:56,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:56,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 06:06:56,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732151865] [2025-01-09 06:06:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732151865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:56,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079139704] [2025-01-09 06:06:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:56,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:56,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:56,532 INFO L87 Difference]: Start difference. First operand 31924 states and 41870 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:57,788 INFO L93 Difference]: Finished difference Result 57081 states and 74922 transitions. [2025-01-09 06:06:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 130 [2025-01-09 06:06:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:57,896 INFO L225 Difference]: With dead ends: 57081 [2025-01-09 06:06:57,896 INFO L226 Difference]: Without dead ends: 25173 [2025-01-09 06:06:57,951 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 06:06:57,952 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 218 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:57,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25173 states. [2025-01-09 06:06:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25173 to 25173. [2025-01-09 06:06:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25173 states, 21859 states have (on average 1.2908184271924608) internal successors, (28216), 22353 states have internal predecessors, (28216), 1565 states have call successors, (1565), 1018 states have call predecessors, (1565), 1748 states have return successors, (3295), 1803 states have call predecessors, (3295), 1563 states have call successors, (3295) [2025-01-09 06:06:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25173 states to 25173 states and 33076 transitions. [2025-01-09 06:06:59,375 INFO L78 Accepts]: Start accepts. Automaton has 25173 states and 33076 transitions. Word has length 130 [2025-01-09 06:06:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 25173 states and 33076 transitions. [2025-01-09 06:06:59,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 25173 states and 33076 transitions. [2025-01-09 06:06:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:06:59,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:59,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 06:06:59,387 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1400051765, now seen corresponding path program 1 times [2025-01-09 06:06:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775037822] [2025-01-09 06:06:59,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:06:59,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:06:59,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:59,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 06:06:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775037822] [2025-01-09 06:06:59,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775037822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:59,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:59,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:06:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911963590] [2025-01-09 06:06:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:06:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:59,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:06:59,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:59,452 INFO L87 Difference]: Start difference. First operand 25173 states and 33076 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:07:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:02,627 INFO L93 Difference]: Finished difference Result 69189 states and 91462 transitions. [2025-01-09 06:07:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 06:07:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 132 [2025-01-09 06:07:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:02,915 INFO L225 Difference]: With dead ends: 69189 [2025-01-09 06:07:02,915 INFO L226 Difference]: Without dead ends: 35190 [2025-01-09 06:07:02,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:07:02,963 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 1495 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:02,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1212 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35190 states. [2025-01-09 06:07:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35190 to 34634. [2025-01-09 06:07:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34634 states, 30171 states have (on average 1.268071989658944) internal successors, (38259), 30845 states have internal predecessors, (38259), 2018 states have call successors, (2018), 1387 states have call predecessors, (2018), 2444 states have return successors, (4289), 2403 states have call predecessors, (4289), 2016 states have call successors, (4289) [2025-01-09 06:07:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 44566 transitions. [2025-01-09 06:07:04,846 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 44566 transitions. Word has length 132 [2025-01-09 06:07:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 34634 states and 44566 transitions. [2025-01-09 06:07:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:07:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 44566 transitions. [2025-01-09 06:07:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 06:07:04,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:04,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:04,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 06:07:04,875 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:04,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1733155390, now seen corresponding path program 1 times [2025-01-09 06:07:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106385284] [2025-01-09 06:07:04,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:04,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 06:07:04,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 06:07:04,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:04,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 06:07:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106385284] [2025-01-09 06:07:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106385284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576782529] [2025-01-09 06:07:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:04,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:04,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:04,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:04,941 INFO L87 Difference]: Start difference. First operand 34634 states and 44566 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 06:07:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:07,278 INFO L93 Difference]: Finished difference Result 63290 states and 81740 transitions. [2025-01-09 06:07:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 06:07:07,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 190 [2025-01-09 06:07:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:07,423 INFO L225 Difference]: With dead ends: 63290 [2025-01-09 06:07:07,423 INFO L226 Difference]: Without dead ends: 35818 [2025-01-09 06:07:07,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:07:07,481 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 837 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:07,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1096 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35818 states. [2025-01-09 06:07:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35818 to 34634. [2025-01-09 06:07:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34634 states, 30171 states have (on average 1.2655530144841072) internal successors, (38183), 30845 states have internal predecessors, (38183), 2018 states have call successors, (2018), 1387 states have call predecessors, (2018), 2444 states have return successors, (4277), 2403 states have call predecessors, (4277), 2016 states have call successors, (4277) [2025-01-09 06:07:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 44478 transitions. [2025-01-09 06:07:09,986 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 44478 transitions. Word has length 190 [2025-01-09 06:07:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:09,987 INFO L471 AbstractCegarLoop]: Abstraction has 34634 states and 44478 transitions. [2025-01-09 06:07:09,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 06:07:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 44478 transitions. [2025-01-09 06:07:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 06:07:10,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:10,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 06:07:10,022 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 33502638, now seen corresponding path program 1 times [2025-01-09 06:07:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587970329] [2025-01-09 06:07:10,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:10,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 06:07:10,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 06:07:10,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:10,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 06:07:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587970329] [2025-01-09 06:07:10,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587970329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:07:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461132836] [2025-01-09 06:07:10,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:10,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:07:10,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:07:10,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:07:10,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:07:10,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 06:07:10,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 06:07:10,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:10,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:10,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 06:07:10,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:07:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 06:07:10,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:07:10,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461132836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:10,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:07:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-01-09 06:07:10,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218129038] [2025-01-09 06:07:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:10,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:10,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:10,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:10,317 INFO L87 Difference]: Start difference. First operand 34634 states and 44478 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:07:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:12,141 INFO L93 Difference]: Finished difference Result 73380 states and 95751 transitions. [2025-01-09 06:07:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:12,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 191 [2025-01-09 06:07:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:12,276 INFO L225 Difference]: With dead ends: 73380 [2025-01-09 06:07:12,277 INFO L226 Difference]: Without dead ends: 38762 [2025-01-09 06:07:12,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:12,357 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 167 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:12,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 270 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38762 states. [2025-01-09 06:07:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38762 to 37158. [2025-01-09 06:07:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37158 states, 32714 states have (on average 1.2364736809928472) internal successors, (40450), 33276 states have internal predecessors, (40450), 2060 states have call successors, (2060), 1525 states have call predecessors, (2060), 2383 states have return successors, (3848), 2358 states have call predecessors, (3848), 2058 states have call successors, (3848) [2025-01-09 06:07:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37158 states to 37158 states and 46358 transitions. [2025-01-09 06:07:14,626 INFO L78 Accepts]: Start accepts. Automaton has 37158 states and 46358 transitions. Word has length 191 [2025-01-09 06:07:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:14,627 INFO L471 AbstractCegarLoop]: Abstraction has 37158 states and 46358 transitions. [2025-01-09 06:07:14,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:07:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37158 states and 46358 transitions. [2025-01-09 06:07:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 06:07:14,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:14,656 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:14,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:07:14,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-01-09 06:07:14,857 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:14,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1900375591, now seen corresponding path program 1 times [2025-01-09 06:07:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:14,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890828098] [2025-01-09 06:07:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:14,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 06:07:14,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 06:07:14,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:14,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-01-09 06:07:14,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:14,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890828098] [2025-01-09 06:07:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890828098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:14,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318296577] [2025-01-09 06:07:14,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:14,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:14,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:14,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:14,904 INFO L87 Difference]: Start difference. First operand 37158 states and 46358 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:07:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:18,270 INFO L93 Difference]: Finished difference Result 80580 states and 100476 transitions. [2025-01-09 06:07:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:18,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 226 [2025-01-09 06:07:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:18,451 INFO L225 Difference]: With dead ends: 80580 [2025-01-09 06:07:18,451 INFO L226 Difference]: Without dead ends: 43436 [2025-01-09 06:07:18,501 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 06:07:18,502 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 140 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:18,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 422 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43436 states. [2025-01-09 06:07:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43436 to 43334. [2025-01-09 06:07:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43334 states, 38114 states have (on average 1.2292071154956183) internal successors, (46850), 38724 states have internal predecessors, (46850), 2480 states have call successors, (2480), 1825 states have call predecessors, (2480), 2739 states have return successors, (4376), 2786 states have call predecessors, (4376), 2478 states have call successors, (4376) [2025-01-09 06:07:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43334 states to 43334 states and 53706 transitions. [2025-01-09 06:07:21,226 INFO L78 Accepts]: Start accepts. Automaton has 43334 states and 53706 transitions. Word has length 226 [2025-01-09 06:07:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:21,226 INFO L471 AbstractCegarLoop]: Abstraction has 43334 states and 53706 transitions. [2025-01-09 06:07:21,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:07:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 43334 states and 53706 transitions. [2025-01-09 06:07:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 06:07:21,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:21,302 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:21,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 06:07:21,302 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:21,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1518246145, now seen corresponding path program 1 times [2025-01-09 06:07:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696299928] [2025-01-09 06:07:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:21,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 06:07:21,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 06:07:21,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:21,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 06:07:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696299928] [2025-01-09 06:07:21,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696299928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:21,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:21,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:21,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490896453] [2025-01-09 06:07:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:21,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:21,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:21,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:21,387 INFO L87 Difference]: Start difference. First operand 43334 states and 53706 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 06:07:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:24,375 INFO L93 Difference]: Finished difference Result 82788 states and 102686 transitions. [2025-01-09 06:07:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 06:07:24,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 229 [2025-01-09 06:07:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:24,520 INFO L225 Difference]: With dead ends: 82788 [2025-01-09 06:07:24,520 INFO L226 Difference]: Without dead ends: 45646 [2025-01-09 06:07:24,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:07:24,564 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 839 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:24,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1059 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45646 states.