./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:34:03,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:34:03,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:34:03,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:34:03,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:34:03,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:34:03,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:34:03,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:34:03,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:34:03,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:34:03,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:34:03,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:34:03,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:34:03,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:34:03,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:34:03,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:34:03,576 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:34:03,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:34:03,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:34:03,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:34:03,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:34:03,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:34:03,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:34:03,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:34:03,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:34:03,578 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/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 -> ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f [2025-03-08 07:34:03,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:34:03,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:34:03,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:34:03,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:34:03,812 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:34:03,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2025-03-08 07:34:04,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd499675d/4d7e546f086447ad90225e9f6f3faf06/FLAG8eeb176b1 [2025-03-08 07:34:05,252 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:34:05,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2025-03-08 07:34:05,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd499675d/4d7e546f086447ad90225e9f6f3faf06/FLAG8eeb176b1 [2025-03-08 07:34:05,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd499675d/4d7e546f086447ad90225e9f6f3faf06 [2025-03-08 07:34:05,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:34:05,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:34:05,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:34:05,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:34:05,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:34:05,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e69cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05, skipping insertion in model container [2025-03-08 07:34:05,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:34:05,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2025-03-08 07:34:05,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2025-03-08 07:34:05,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:34:05,819 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:34:05,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2025-03-08 07:34:05,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2025-03-08 07:34:05,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:34:05,912 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:34:05,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05 WrapperNode [2025-03-08 07:34:05,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:34:05,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:34:05,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:34:05,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:34:05,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,967 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1074 [2025-03-08 07:34:05,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:34:05,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:34:05,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:34:05,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:34:05,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,998 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-03-08 07:34:05,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:05,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:06,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:06,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:06,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:06,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:06,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:34:06,017 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:34:06,017 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:34:06,017 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:34:06,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (1/1) ... [2025-03-08 07:34:06,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:34:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:06,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:34:06,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:34:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:34:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:34:06,076 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:34:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:34:06,076 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:34:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:34:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:34:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:34:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:34:06,180 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:34:06,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:34:06,946 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-08 07:34:06,946 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:34:06,960 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:34:06,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:34:06,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:34:06 BoogieIcfgContainer [2025-03-08 07:34:06,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:34:06,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:34:06,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:34:06,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:34:06,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:34:05" (1/3) ... [2025-03-08 07:34:06,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd617be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:34:06, skipping insertion in model container [2025-03-08 07:34:06,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:05" (2/3) ... [2025-03-08 07:34:06,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd617be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:34:06, skipping insertion in model container [2025-03-08 07:34:06,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:34:06" (3/3) ... [2025-03-08 07:34:06,972 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2025-03-08 07:34:06,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:34:06,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.13.cil-1.c that has 16 procedures, 510 locations, 1 initial locations, 20 loop locations, and 2 error locations. [2025-03-08 07:34:07,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:34:07,048 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;@35f2708f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:34:07,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:34:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 510 states, 451 states have (on average 1.605321507760532) internal successors, (724), 457 states have internal predecessors, (724), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 07:34:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:07,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:07,063 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] [2025-03-08 07:34:07,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:07,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1850709678, now seen corresponding path program 1 times [2025-03-08 07:34:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66337101] [2025-03-08 07:34:07,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:07,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:07,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:07,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:07,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:07,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66337101] [2025-03-08 07:34:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66337101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170659499] [2025-03-08 07:34:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:07,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:07,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:07,529 INFO L87 Difference]: Start difference. First operand has 510 states, 451 states have (on average 1.605321507760532) internal successors, (724), 457 states have internal predecessors, (724), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-03-08 07:34:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:08,402 INFO L93 Difference]: Finished difference Result 1089 states and 1722 transitions. [2025-03-08 07:34:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:34:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:08,417 INFO L225 Difference]: With dead ends: 1089 [2025-03-08 07:34:08,417 INFO L226 Difference]: Without dead ends: 598 [2025-03-08 07:34:08,426 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-03-08 07:34:08,432 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 497 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:08,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1631 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:34:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-08 07:34:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 591. [2025-03-08 07:34:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 513 states have (on average 1.5458089668615984) internal successors, (793), 520 states have internal predecessors, (793), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2025-03-08 07:34:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 902 transitions. [2025-03-08 07:34:08,514 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 902 transitions. Word has length 62 [2025-03-08 07:34:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:08,515 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 902 transitions. [2025-03-08 07:34:08,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-03-08 07:34:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 902 transitions. [2025-03-08 07:34:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:08,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:08,520 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] [2025-03-08 07:34:08,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:34:08,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash -165411019, now seen corresponding path program 1 times [2025-03-08 07:34:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870082018] [2025-03-08 07:34:08,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:08,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:08,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:08,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:08,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:08,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870082018] [2025-03-08 07:34:08,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870082018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:08,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:08,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766606527] [2025-03-08 07:34:08,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:08,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:08,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:08,730 INFO L87 Difference]: Start difference. First operand 591 states and 902 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-03-08 07:34:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:09,558 INFO L93 Difference]: Finished difference Result 896 states and 1321 transitions. [2025-03-08 07:34:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-03-08 07:34:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:09,563 INFO L225 Difference]: With dead ends: 896 [2025-03-08 07:34:09,563 INFO L226 Difference]: Without dead ends: 727 [2025-03-08 07:34:09,564 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-03-08 07:34:09,565 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1144 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:09,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1799 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-08 07:34:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 683. [2025-03-08 07:34:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 585 states have (on average 1.5264957264957264) internal successors, (893), 594 states have internal predecessors, (893), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2025-03-08 07:34:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1032 transitions. [2025-03-08 07:34:09,617 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1032 transitions. Word has length 62 [2025-03-08 07:34:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:09,617 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1032 transitions. [2025-03-08 07:34:09,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-03-08 07:34:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1032 transitions. [2025-03-08 07:34:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:09,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:09,621 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] [2025-03-08 07:34:09,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:34:09,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 804170004, now seen corresponding path program 1 times [2025-03-08 07:34:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353120110] [2025-03-08 07:34:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:09,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:09,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:09,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:09,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:09,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353120110] [2025-03-08 07:34:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353120110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:09,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:09,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756717449] [2025-03-08 07:34:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:09,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:09,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:09,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:09,714 INFO L87 Difference]: Start difference. First operand 683 states and 1032 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-03-08 07:34:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:09,760 INFO L93 Difference]: Finished difference Result 943 states and 1393 transitions. [2025-03-08 07:34:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:34:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:09,765 INFO L225 Difference]: With dead ends: 943 [2025-03-08 07:34:09,765 INFO L226 Difference]: Without dead ends: 688 [2025-03-08 07:34:09,766 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-03-08 07:34:09,767 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 0 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:09,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3850 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-08 07:34:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-08 07:34:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 589 states have (on average 1.5195246179966044) internal successors, (895), 598 states have internal predecessors, (895), 65 states have call successors, (65), 29 states have call predecessors, (65), 32 states have return successors, (75), 64 states have call predecessors, (75), 61 states have call successors, (75) [2025-03-08 07:34:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1035 transitions. [2025-03-08 07:34:09,798 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1035 transitions. Word has length 62 [2025-03-08 07:34:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:09,798 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1035 transitions. [2025-03-08 07:34:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-03-08 07:34:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1035 transitions. [2025-03-08 07:34:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:09,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:09,800 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] [2025-03-08 07:34:09,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:34:09,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1765316395, now seen corresponding path program 1 times [2025-03-08 07:34:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553243474] [2025-03-08 07:34:09,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:09,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:09,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553243474] [2025-03-08 07:34:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553243474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:34:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777420349] [2025-03-08 07:34:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:34:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:09,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:34:09,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:34:09,906 INFO L87 Difference]: Start difference. First operand 688 states and 1035 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:34:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:11,079 INFO L93 Difference]: Finished difference Result 1870 states and 2671 transitions. [2025-03-08 07:34:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:34:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-03-08 07:34:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:11,090 INFO L225 Difference]: With dead ends: 1870 [2025-03-08 07:34:11,090 INFO L226 Difference]: Without dead ends: 1592 [2025-03-08 07:34:11,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:34:11,094 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 3300 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3314 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:11,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3314 Valid, 1944 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:34:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-03-08 07:34:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1544. [2025-03-08 07:34:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1259 states have (on average 1.420969023034154) internal successors, (1789), 1283 states have internal predecessors, (1789), 153 states have call successors, (153), 112 states have call predecessors, (153), 130 states have return successors, (189), 151 states have call predecessors, (189), 149 states have call successors, (189) [2025-03-08 07:34:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2131 transitions. [2025-03-08 07:34:11,203 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2131 transitions. Word has length 62 [2025-03-08 07:34:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:11,203 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2131 transitions. [2025-03-08 07:34:11,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:34:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2131 transitions. [2025-03-08 07:34:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:11,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:11,204 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] [2025-03-08 07:34:11,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:34:11,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:11,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash -182052814, now seen corresponding path program 1 times [2025-03-08 07:34:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875297040] [2025-03-08 07:34:11,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:11,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:11,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:11,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-03-08 07:34:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875297040] [2025-03-08 07:34:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875297040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904587977] [2025-03-08 07:34:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:11,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:11,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:11,309 INFO L87 Difference]: Start difference. First operand 1544 states and 2131 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-03-08 07:34:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:11,386 INFO L93 Difference]: Finished difference Result 2702 states and 3652 transitions. [2025-03-08 07:34:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:34:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:11,394 INFO L225 Difference]: With dead ends: 2702 [2025-03-08 07:34:11,394 INFO L226 Difference]: Without dead ends: 1574 [2025-03-08 07:34:11,397 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-03-08 07:34:11,398 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 0 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:11,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3850 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-08 07:34:11,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2025-03-08 07:34:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1283 states have (on average 1.406858924395947) internal successors, (1805), 1307 states have internal predecessors, (1805), 153 states have call successors, (153), 112 states have call predecessors, (153), 136 states have return successors, (195), 157 states have call predecessors, (195), 149 states have call successors, (195) [2025-03-08 07:34:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2153 transitions. [2025-03-08 07:34:11,480 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2153 transitions. Word has length 62 [2025-03-08 07:34:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:11,481 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2153 transitions. [2025-03-08 07:34:11,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-03-08 07:34:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2153 transitions. [2025-03-08 07:34:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:11,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:11,482 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] [2025-03-08 07:34:11,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:34:11,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:11,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash -151033007, now seen corresponding path program 1 times [2025-03-08 07:34:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:11,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695581820] [2025-03-08 07:34:11,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:11,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:11,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695581820] [2025-03-08 07:34:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695581820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:11,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696824766] [2025-03-08 07:34:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:11,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:11,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:11,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:11,611 INFO L87 Difference]: Start difference. First operand 1574 states and 2153 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-03-08 07:34:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:12,410 INFO L93 Difference]: Finished difference Result 2746 states and 3609 transitions. [2025-03-08 07:34:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:34:12,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-03-08 07:34:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:12,419 INFO L225 Difference]: With dead ends: 2746 [2025-03-08 07:34:12,419 INFO L226 Difference]: Without dead ends: 1800 [2025-03-08 07:34:12,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:34:12,422 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1129 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:12,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1605 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-03-08 07:34:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1519. [2025-03-08 07:34:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1244 states have (on average 1.4043408360128617) internal successors, (1747), 1263 states have internal predecessors, (1747), 147 states have call successors, (147), 107 states have call predecessors, (147), 126 states have return successors, (180), 150 states have call predecessors, (180), 143 states have call successors, (180) [2025-03-08 07:34:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2074 transitions. [2025-03-08 07:34:12,489 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2074 transitions. Word has length 62 [2025-03-08 07:34:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:12,490 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2074 transitions. [2025-03-08 07:34:12,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-03-08 07:34:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2074 transitions. [2025-03-08 07:34:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:12,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:12,491 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] [2025-03-08 07:34:12,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:34:12,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 60317906, now seen corresponding path program 1 times [2025-03-08 07:34:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:12,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583082035] [2025-03-08 07:34:12,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:12,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:12,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:12,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:12,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583082035] [2025-03-08 07:34:12,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583082035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:12,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:12,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:34:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268247541] [2025-03-08 07:34:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:12,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:34:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:12,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:34:12,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:34:12,543 INFO L87 Difference]: Start difference. First operand 1519 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:34:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:13,042 INFO L93 Difference]: Finished difference Result 3650 states and 4813 transitions. [2025-03-08 07:34:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:34:13,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:34:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:13,052 INFO L225 Difference]: With dead ends: 3650 [2025-03-08 07:34:13,052 INFO L226 Difference]: Without dead ends: 2548 [2025-03-08 07:34:13,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-08 07:34:13,055 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1090 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:13,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 816 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-03-08 07:34:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2544. [2025-03-08 07:34:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2026 states have (on average 1.3331688055281343) internal successors, (2701), 2062 states have internal predecessors, (2701), 266 states have call successors, (266), 206 states have call predecessors, (266), 250 states have return successors, (371), 278 states have call predecessors, (371), 262 states have call successors, (371) [2025-03-08 07:34:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3338 transitions. [2025-03-08 07:34:13,149 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3338 transitions. Word has length 62 [2025-03-08 07:34:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3338 transitions. [2025-03-08 07:34:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:34:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3338 transitions. [2025-03-08 07:34:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:34:13,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:13,150 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-03-08 07:34:13,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:34:13,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:13,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash 57461852, now seen corresponding path program 1 times [2025-03-08 07:34:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613288507] [2025-03-08 07:34:13,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:13,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:13,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:34:13,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:34:13,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:13,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:13,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:13,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613288507] [2025-03-08 07:34:13,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613288507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:13,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:13,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946247011] [2025-03-08 07:34:13,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:13,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:13,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:13,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:13,178 INFO L87 Difference]: Start difference. First operand 2544 states and 3338 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:34:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:13,297 INFO L93 Difference]: Finished difference Result 5528 states and 7123 transitions. [2025-03-08 07:34:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 07:34:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:13,315 INFO L225 Difference]: With dead ends: 5528 [2025-03-08 07:34:13,315 INFO L226 Difference]: Without dead ends: 3406 [2025-03-08 07:34:13,321 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-03-08 07:34:13,321 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 101 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:13,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-03-08 07:34:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3338. [2025-03-08 07:34:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2634 states have (on average 1.3120728929384966) internal successors, (3456), 2675 states have internal predecessors, (3456), 358 states have call successors, (358), 286 states have call predecessors, (358), 344 states have return successors, (485), 379 states have call predecessors, (485), 354 states have call successors, (485) [2025-03-08 07:34:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4299 transitions. [2025-03-08 07:34:13,512 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4299 transitions. Word has length 63 [2025-03-08 07:34:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:13,513 INFO L471 AbstractCegarLoop]: Abstraction has 3338 states and 4299 transitions. [2025-03-08 07:34:13,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:34:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4299 transitions. [2025-03-08 07:34:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:34:13,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:13,516 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] [2025-03-08 07:34:13,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:34:13,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:13,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:13,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2141924824, now seen corresponding path program 1 times [2025-03-08 07:34:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106964771] [2025-03-08 07:34:13,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:13,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:13,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:34:13,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:34:13,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:13,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:13,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:13,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106964771] [2025-03-08 07:34:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106964771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:34:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066008207] [2025-03-08 07:34:13,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:34:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:13,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:34:13,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:34:13,627 INFO L87 Difference]: Start difference. First operand 3338 states and 4299 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:34:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:13,938 INFO L93 Difference]: Finished difference Result 4263 states and 5417 transitions. [2025-03-08 07:34:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-03-08 07:34:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:13,956 INFO L225 Difference]: With dead ends: 4263 [2025-03-08 07:34:13,956 INFO L226 Difference]: Without dead ends: 4260 [2025-03-08 07:34:13,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-08 07:34:13,959 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1440 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:13,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 875 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:34:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2025-03-08 07:34:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3788. [2025-03-08 07:34:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 2977 states have (on average 1.2986227746053074) internal successors, (3866), 3021 states have internal predecessors, (3866), 408 states have call successors, (408), 330 states have call predecessors, (408), 401 states have return successors, (562), 439 states have call predecessors, (562), 405 states have call successors, (562) [2025-03-08 07:34:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 4836 transitions. [2025-03-08 07:34:14,162 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 4836 transitions. Word has length 68 [2025-03-08 07:34:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:14,162 INFO L471 AbstractCegarLoop]: Abstraction has 3788 states and 4836 transitions. [2025-03-08 07:34:14,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:34:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4836 transitions. [2025-03-08 07:34:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:34:14,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:14,163 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] [2025-03-08 07:34:14,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:34:14,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1975791464, now seen corresponding path program 1 times [2025-03-08 07:34:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:14,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061424421] [2025-03-08 07:34:14,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:14,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:34:14,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:34:14,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:14,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061424421] [2025-03-08 07:34:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061424421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472719378] [2025-03-08 07:34:14,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:14,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:34:14,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:34:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:34:14,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:34:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:14,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:34:14,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:14,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:34:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:14,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472719378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:34:14,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:34:14,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:34:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326881945] [2025-03-08 07:34:14,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:34:14,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:34:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:14,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:34:14,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:34:14,648 INFO L87 Difference]: Start difference. First operand 3788 states and 4836 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:34:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:15,225 INFO L93 Difference]: Finished difference Result 7612 states and 9512 transitions. [2025-03-08 07:34:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:34:15,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-03-08 07:34:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:15,256 INFO L225 Difference]: With dead ends: 7612 [2025-03-08 07:34:15,256 INFO L226 Difference]: Without dead ends: 7609 [2025-03-08 07:34:15,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:34:15,260 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 1761 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:15,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 2741 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:34:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2025-03-08 07:34:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 7228. [2025-03-08 07:34:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7228 states, 5639 states have (on average 1.269019329668381) internal successors, (7156), 5718 states have internal predecessors, (7156), 785 states have call successors, (785), 660 states have call predecessors, (785), 802 states have return successors, (1087), 852 states have call predecessors, (1087), 782 states have call successors, (1087) [2025-03-08 07:34:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7228 states to 7228 states and 9028 transitions. [2025-03-08 07:34:15,780 INFO L78 Accepts]: Start accepts. Automaton has 7228 states and 9028 transitions. Word has length 69 [2025-03-08 07:34:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:15,781 INFO L471 AbstractCegarLoop]: Abstraction has 7228 states and 9028 transitions. [2025-03-08 07:34:15,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:34:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7228 states and 9028 transitions. [2025-03-08 07:34:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:34:15,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:15,782 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:34:15,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:34:15,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 07:34:15,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:15,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -513977605, now seen corresponding path program 2 times [2025-03-08 07:34:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391150876] [2025-03-08 07:34:15,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:34:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:15,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:34:16,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:34:16,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:34:16,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391150876] [2025-03-08 07:34:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391150876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:16,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:16,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723999518] [2025-03-08 07:34:16,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:16,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:16,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:16,022 INFO L87 Difference]: Start difference. First operand 7228 states and 9028 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:34:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:16,172 INFO L93 Difference]: Finished difference Result 9523 states and 11921 transitions. [2025-03-08 07:34:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-03-08 07:34:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:16,192 INFO L225 Difference]: With dead ends: 9523 [2025-03-08 07:34:16,193 INFO L226 Difference]: Without dead ends: 3587 [2025-03-08 07:34:16,205 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-03-08 07:34:16,206 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 743 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:16,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 959 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2025-03-08 07:34:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 2856. [2025-03-08 07:34:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2269 states have (on average 1.2908770383428823) internal successors, (2929), 2294 states have internal predecessors, (2929), 306 states have call successors, (306), 244 states have call predecessors, (306), 279 states have return successors, (389), 320 states have call predecessors, (389), 303 states have call successors, (389) [2025-03-08 07:34:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3624 transitions. [2025-03-08 07:34:16,392 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3624 transitions. Word has length 71 [2025-03-08 07:34:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:16,392 INFO L471 AbstractCegarLoop]: Abstraction has 2856 states and 3624 transitions. [2025-03-08 07:34:16,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:34:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3624 transitions. [2025-03-08 07:34:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:34:16,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:16,396 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 07:34:16,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:34:16,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1409376431, now seen corresponding path program 1 times [2025-03-08 07:34:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:16,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362297921] [2025-03-08 07:34:16,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:16,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:34:16,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:34:16,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:16,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:34:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362297921] [2025-03-08 07:34:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362297921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367427444] [2025-03-08 07:34:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:16,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:16,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:16,483 INFO L87 Difference]: Start difference. First operand 2856 states and 3624 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-03-08 07:34:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:17,558 INFO L93 Difference]: Finished difference Result 7776 states and 9637 transitions. [2025-03-08 07:34:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:34:17,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 80 [2025-03-08 07:34:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:17,573 INFO L225 Difference]: With dead ends: 7776 [2025-03-08 07:34:17,573 INFO L226 Difference]: Without dead ends: 4588 [2025-03-08 07:34:17,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:34:17,580 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 850 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:17,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 2064 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:34:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2025-03-08 07:34:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4411. [2025-03-08 07:34:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4411 states, 3454 states have (on average 1.2484076433121019) internal successors, (4312), 3509 states have internal predecessors, (4312), 481 states have call successors, (481), 398 states have call predecessors, (481), 474 states have return successors, (679), 506 states have call predecessors, (679), 478 states have call successors, (679) [2025-03-08 07:34:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4411 states to 4411 states and 5472 transitions. [2025-03-08 07:34:17,833 INFO L78 Accepts]: Start accepts. Automaton has 4411 states and 5472 transitions. Word has length 80 [2025-03-08 07:34:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:17,833 INFO L471 AbstractCegarLoop]: Abstraction has 4411 states and 5472 transitions. [2025-03-08 07:34:17,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-03-08 07:34:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4411 states and 5472 transitions. [2025-03-08 07:34:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:34:17,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:17,835 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 07:34:17,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:34:17,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:17,836 INFO L85 PathProgramCache]: Analyzing trace with hash -469027808, now seen corresponding path program 1 times [2025-03-08 07:34:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132431105] [2025-03-08 07:34:17,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:17,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:34:17,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:34:17,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:17,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 07:34:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132431105] [2025-03-08 07:34:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132431105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:34:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069555849] [2025-03-08 07:34:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:34:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:17,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:34:17,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:34:17,928 INFO L87 Difference]: Start difference. First operand 4411 states and 5472 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:34:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:19,218 INFO L93 Difference]: Finished difference Result 7358 states and 9047 transitions. [2025-03-08 07:34:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:34:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-03-08 07:34:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:19,232 INFO L225 Difference]: With dead ends: 7358 [2025-03-08 07:34:19,232 INFO L226 Difference]: Without dead ends: 3580 [2025-03-08 07:34:19,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:34:19,240 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 1742 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:19,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 2130 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:34:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-03-08 07:34:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3259. [2025-03-08 07:34:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2560 states have (on average 1.244140625) internal successors, (3185), 2602 states have internal predecessors, (3185), 350 states have call successors, (350), 281 states have call predecessors, (350), 347 states have return successors, (468), 378 states have call predecessors, (468), 347 states have call successors, (468) [2025-03-08 07:34:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 4003 transitions. [2025-03-08 07:34:19,438 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 4003 transitions. Word has length 86 [2025-03-08 07:34:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:19,439 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 4003 transitions. [2025-03-08 07:34:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:34:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 4003 transitions. [2025-03-08 07:34:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 07:34:19,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:19,442 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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] [2025-03-08 07:34:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:34:19,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1929905149, now seen corresponding path program 1 times [2025-03-08 07:34:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621740026] [2025-03-08 07:34:19,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:19,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:34:19,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:34:19,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:19,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 07:34:19,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:19,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621740026] [2025-03-08 07:34:19,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621740026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285837301] [2025-03-08 07:34:19,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:19,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:19,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:19,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:34:19,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:34:19,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:34:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:34:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:19,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 07:34:19,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:34:19,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:34:19,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285837301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:19,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:34:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 07:34:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695895798] [2025-03-08 07:34:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:19,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:19,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:19,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:19,725 INFO L87 Difference]: Start difference. First operand 3259 states and 4003 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:34:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:19,815 INFO L93 Difference]: Finished difference Result 4737 states and 5767 transitions. [2025-03-08 07:34:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 07:34:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:19,827 INFO L225 Difference]: With dead ends: 4737 [2025-03-08 07:34:19,827 INFO L226 Difference]: Without dead ends: 1900 [2025-03-08 07:34:19,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:19,835 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 0 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3831 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-03-08 07:34:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1887. [2025-03-08 07:34:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1549 states have (on average 1.2827630729502906) internal successors, (1987), 1564 states have internal predecessors, (1987), 174 states have call successors, (174), 126 states have call predecessors, (174), 162 states have return successors, (230), 197 states have call predecessors, (230), 171 states have call successors, (230) [2025-03-08 07:34:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2391 transitions. [2025-03-08 07:34:19,919 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2391 transitions. Word has length 139 [2025-03-08 07:34:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:19,919 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2391 transitions. [2025-03-08 07:34:19,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:34:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2391 transitions. [2025-03-08 07:34:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 07:34:19,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:19,922 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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] [2025-03-08 07:34:19,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:34:20,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 07:34:20,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:20,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash -534008099, now seen corresponding path program 1 times [2025-03-08 07:34:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803567131] [2025-03-08 07:34:20,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:20,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 07:34:20,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 07:34:20,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 07:34:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803567131] [2025-03-08 07:34:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803567131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619193586] [2025-03-08 07:34:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:20,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:20,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:20,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:20,159 INFO L87 Difference]: Start difference. First operand 1887 states and 2391 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:34:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:20,223 INFO L93 Difference]: Finished difference Result 3031 states and 3759 transitions. [2025-03-08 07:34:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:20,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 141 [2025-03-08 07:34:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:20,234 INFO L225 Difference]: With dead ends: 3031 [2025-03-08 07:34:20,234 INFO L226 Difference]: Without dead ends: 1735 [2025-03-08 07:34:20,236 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-03-08 07:34:20,237 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 119 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1415 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-03-08 07:34:20,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1415 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-03-08 07:34:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2025-03-08 07:34:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1433 states have (on average 1.2972784368457781) internal successors, (1859), 1448 states have internal predecessors, (1859), 156 states have call successors, (156), 110 states have call predecessors, (156), 144 states have return successors, (207), 177 states have call predecessors, (207), 153 states have call successors, (207) [2025-03-08 07:34:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2222 transitions. [2025-03-08 07:34:20,311 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2222 transitions. Word has length 141 [2025-03-08 07:34:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:20,311 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2222 transitions. [2025-03-08 07:34:20,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:34:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2222 transitions. [2025-03-08 07:34:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 07:34:20,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:20,313 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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-03-08 07:34:20,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:34:20,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:20,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash 529293344, now seen corresponding path program 1 times [2025-03-08 07:34:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:20,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131849090] [2025-03-08 07:34:20,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:20,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 07:34:20,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 07:34:20,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:20,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 07:34:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131849090] [2025-03-08 07:34:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131849090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:20,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:20,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269740609] [2025-03-08 07:34:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:20,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:20,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:20,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:20,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:20,387 INFO L87 Difference]: Start difference. First operand 1735 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 07:34:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:21,033 INFO L93 Difference]: Finished difference Result 2930 states and 3650 transitions. [2025-03-08 07:34:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2025-03-08 07:34:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:21,040 INFO L225 Difference]: With dead ends: 2930 [2025-03-08 07:34:21,040 INFO L226 Difference]: Without dead ends: 1685 [2025-03-08 07:34:21,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:34:21,042 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 383 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:21,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1582 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-03-08 07:34:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1595. [2025-03-08 07:34:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1321 states have (on average 1.3133989401968207) internal successors, (1735), 1335 states have internal predecessors, (1735), 142 states have call successors, (142), 98 states have call predecessors, (142), 130 states have return successors, (187), 162 states have call predecessors, (187), 139 states have call successors, (187) [2025-03-08 07:34:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2064 transitions. [2025-03-08 07:34:21,114 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2064 transitions. Word has length 150 [2025-03-08 07:34:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:21,114 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2064 transitions. [2025-03-08 07:34:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 07:34:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2064 transitions. [2025-03-08 07:34:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 07:34:21,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:21,116 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:21,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:34:21,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:21,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1499606742, now seen corresponding path program 1 times [2025-03-08 07:34:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132306375] [2025-03-08 07:34:21,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:34:21,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:34:21,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:21,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 07:34:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:21,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132306375] [2025-03-08 07:34:21,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132306375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:21,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462371756] [2025-03-08 07:34:21,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:21,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:21,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:21,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:34:21,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:34:21,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:34:21,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:34:21,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:21,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:21,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 07:34:21,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 07:34:21,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:34:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 07:34:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462371756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:34:21,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:34:21,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-08 07:34:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503750273] [2025-03-08 07:34:21,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:34:21,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 07:34:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 07:34:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:21,739 INFO L87 Difference]: Start difference. First operand 1595 states and 2064 transitions. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 07:34:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:23,051 INFO L93 Difference]: Finished difference Result 3341 states and 4237 transitions. [2025-03-08 07:34:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 07:34:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 153 [2025-03-08 07:34:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:23,058 INFO L225 Difference]: With dead ends: 3341 [2025-03-08 07:34:23,058 INFO L226 Difference]: Without dead ends: 2080 [2025-03-08 07:34:23,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-08 07:34:23,061 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1446 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:23,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 2860 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:34:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-03-08 07:34:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1869. [2025-03-08 07:34:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1520 states have (on average 1.2723684210526316) internal successors, (1934), 1535 states have internal predecessors, (1934), 182 states have call successors, (182), 136 states have call predecessors, (182), 165 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2025-03-08 07:34:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2372 transitions. [2025-03-08 07:34:23,147 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2372 transitions. Word has length 153 [2025-03-08 07:34:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:23,147 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2372 transitions. [2025-03-08 07:34:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 07:34:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2372 transitions. [2025-03-08 07:34:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:23,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:23,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:23,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 07:34:23,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:23,352 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:23,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1212017102, now seen corresponding path program 1 times [2025-03-08 07:34:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138402916] [2025-03-08 07:34:23,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:23,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:23,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:23,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:23,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138402916] [2025-03-08 07:34:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138402916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:23,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409662105] [2025-03-08 07:34:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:23,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:23,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:23,396 INFO L87 Difference]: Start difference. First operand 1869 states and 2372 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:23,467 INFO L93 Difference]: Finished difference Result 2265 states and 3000 transitions. [2025-03-08 07:34:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 188 [2025-03-08 07:34:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:23,473 INFO L225 Difference]: With dead ends: 2265 [2025-03-08 07:34:23,473 INFO L226 Difference]: Without dead ends: 1869 [2025-03-08 07:34:23,474 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-03-08 07:34:23,474 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 635 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 892 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-03-08 07:34:23,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 892 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-03-08 07:34:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1869. [2025-03-08 07:34:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1520 states have (on average 1.2717105263157895) internal successors, (1933), 1535 states have internal predecessors, (1933), 182 states have call successors, (182), 136 states have call predecessors, (182), 165 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2025-03-08 07:34:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2371 transitions. [2025-03-08 07:34:23,557 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2371 transitions. Word has length 188 [2025-03-08 07:34:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:23,557 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2371 transitions. [2025-03-08 07:34:23,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2371 transitions. [2025-03-08 07:34:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:23,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:23,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:23,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:34:23,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1221787663, now seen corresponding path program 1 times [2025-03-08 07:34:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338882380] [2025-03-08 07:34:23,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:23,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:23,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:23,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:23,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338882380] [2025-03-08 07:34:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338882380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:23,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769650114] [2025-03-08 07:34:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:23,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:23,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:23,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:23,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:23,603 INFO L87 Difference]: Start difference. First operand 1869 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:23,672 INFO L93 Difference]: Finished difference Result 2257 states and 2983 transitions. [2025-03-08 07:34:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:23,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 188 [2025-03-08 07:34:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:23,679 INFO L225 Difference]: With dead ends: 2257 [2025-03-08 07:34:23,679 INFO L226 Difference]: Without dead ends: 1869 [2025-03-08 07:34:23,680 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-03-08 07:34:23,681 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 626 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 891 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-03-08 07:34:23,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 891 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-03-08 07:34:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1869. [2025-03-08 07:34:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1520 states have (on average 1.2710526315789474) internal successors, (1932), 1535 states have internal predecessors, (1932), 182 states have call successors, (182), 136 states have call predecessors, (182), 165 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2025-03-08 07:34:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2370 transitions. [2025-03-08 07:34:23,816 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2370 transitions. Word has length 188 [2025-03-08 07:34:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:23,816 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2370 transitions. [2025-03-08 07:34:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2370 transitions. [2025-03-08 07:34:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:23,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:23,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:34:23,821 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -517924688, now seen corresponding path program 1 times [2025-03-08 07:34:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305839605] [2025-03-08 07:34:23,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:23,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:23,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305839605] [2025-03-08 07:34:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305839605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:23,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170325274] [2025-03-08 07:34:23,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:23,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:23,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:23,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:23,930 INFO L87 Difference]: Start difference. First operand 1869 states and 2370 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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-03-08 07:34:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:24,584 INFO L93 Difference]: Finished difference Result 2693 states and 3694 transitions. [2025-03-08 07:34:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:24,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:24,591 INFO L225 Difference]: With dead ends: 2693 [2025-03-08 07:34:24,592 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 07:34:24,593 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-03-08 07:34:24,593 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1407 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:24,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 1939 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 07:34:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2274. [2025-03-08 07:34:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 1896 states have (on average 1.3380801687763713) internal successors, (2537), 1912 states have internal predecessors, (2537), 204 states have call successors, (204), 142 states have call predecessors, (204), 172 states have return successors, (279), 220 states have call predecessors, (279), 201 states have call successors, (279) [2025-03-08 07:34:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3020 transitions. [2025-03-08 07:34:24,695 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3020 transitions. Word has length 188 [2025-03-08 07:34:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 3020 transitions. [2025-03-08 07:34:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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-03-08 07:34:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3020 transitions. [2025-03-08 07:34:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:24,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:24,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:34:24,699 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1731391150, now seen corresponding path program 1 times [2025-03-08 07:34:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592369114] [2025-03-08 07:34:24,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:24,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:24,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:24,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:24,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:24,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592369114] [2025-03-08 07:34:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592369114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:24,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202678332] [2025-03-08 07:34:24,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:24,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:24,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:24,808 INFO L87 Difference]: Start difference. First operand 2274 states and 3020 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:25,664 INFO L93 Difference]: Finished difference Result 3586 states and 5151 transitions. [2025-03-08 07:34:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:25,672 INFO L225 Difference]: With dead ends: 3586 [2025-03-08 07:34:25,673 INFO L226 Difference]: Without dead ends: 2795 [2025-03-08 07:34:25,674 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-03-08 07:34:25,675 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 1418 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:25,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 3665 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2025-03-08 07:34:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2650. [2025-03-08 07:34:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2243 states have (on average 1.3749442710655373) internal successors, (3084), 2260 states have internal predecessors, (3084), 226 states have call successors, (226), 148 states have call predecessors, (226), 179 states have return successors, (304), 243 states have call predecessors, (304), 223 states have call successors, (304) [2025-03-08 07:34:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3614 transitions. [2025-03-08 07:34:25,789 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3614 transitions. Word has length 188 [2025-03-08 07:34:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:25,789 INFO L471 AbstractCegarLoop]: Abstraction has 2650 states and 3614 transitions. [2025-03-08 07:34:25,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3614 transitions. [2025-03-08 07:34:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:25,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:25,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:25,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:34:25,793 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:25,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:25,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1980669551, now seen corresponding path program 1 times [2025-03-08 07:34:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857221906] [2025-03-08 07:34:25,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:25,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:25,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:25,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857221906] [2025-03-08 07:34:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857221906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893329318] [2025-03-08 07:34:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:25,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:25,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:25,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:25,894 INFO L87 Difference]: Start difference. First operand 2650 states and 3614 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:26,713 INFO L93 Difference]: Finished difference Result 4790 states and 7084 transitions. [2025-03-08 07:34:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:26,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:26,726 INFO L225 Difference]: With dead ends: 4790 [2025-03-08 07:34:26,726 INFO L226 Difference]: Without dead ends: 3623 [2025-03-08 07:34:26,730 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-03-08 07:34:26,731 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 1413 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3649 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:26,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3649 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-08 07:34:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3455. [2025-03-08 07:34:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3455 states, 2988 states have (on average 1.4313922356091031) internal successors, (4277), 3009 states have internal predecessors, (4277), 270 states have call successors, (270), 160 states have call predecessors, (270), 195 states have return successors, (360), 289 states have call predecessors, (360), 267 states have call successors, (360) [2025-03-08 07:34:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4907 transitions. [2025-03-08 07:34:26,912 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4907 transitions. Word has length 188 [2025-03-08 07:34:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:26,913 INFO L471 AbstractCegarLoop]: Abstraction has 3455 states and 4907 transitions. [2025-03-08 07:34:26,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4907 transitions. [2025-03-08 07:34:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:26,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:26,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:26,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:34:26,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:26,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2029161842, now seen corresponding path program 1 times [2025-03-08 07:34:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411721434] [2025-03-08 07:34:26,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:26,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:26,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:26,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:26,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:27,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411721434] [2025-03-08 07:34:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411721434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329795237] [2025-03-08 07:34:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:27,013 INFO L87 Difference]: Start difference. First operand 3455 states and 4907 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:27,843 INFO L93 Difference]: Finished difference Result 7405 states and 11367 transitions. [2025-03-08 07:34:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:27,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:27,856 INFO L225 Difference]: With dead ends: 7405 [2025-03-08 07:34:27,856 INFO L226 Difference]: Without dead ends: 5433 [2025-03-08 07:34:27,862 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-03-08 07:34:27,862 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 1408 mSDsluCounter, 2735 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3637 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:27,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3637 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2025-03-08 07:34:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 5218. [2025-03-08 07:34:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 4625 states have (on average 1.5024864864864864) internal successors, (6949), 4660 states have internal predecessors, (6949), 358 states have call successors, (358), 184 states have call predecessors, (358), 233 states have return successors, (496), 381 states have call predecessors, (496), 355 states have call successors, (496) [2025-03-08 07:34:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7803 transitions. [2025-03-08 07:34:28,097 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7803 transitions. Word has length 188 [2025-03-08 07:34:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:28,098 INFO L471 AbstractCegarLoop]: Abstraction has 5218 states and 7803 transitions. [2025-03-08 07:34:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7803 transitions. [2025-03-08 07:34:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:28,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:28,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:28,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:34:28,101 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:28,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1327227249, now seen corresponding path program 1 times [2025-03-08 07:34:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:28,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998729363] [2025-03-08 07:34:28,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:28,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:28,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:28,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:28,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:28,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998729363] [2025-03-08 07:34:28,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998729363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:28,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508340032] [2025-03-08 07:34:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:28,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:28,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:28,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:28,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:28,204 INFO L87 Difference]: Start difference. First operand 5218 states and 7803 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:29,102 INFO L93 Difference]: Finished difference Result 13228 states and 21161 transitions. [2025-03-08 07:34:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:29,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:29,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:29,126 INFO L225 Difference]: With dead ends: 13228 [2025-03-08 07:34:29,126 INFO L226 Difference]: Without dead ends: 9493 [2025-03-08 07:34:29,136 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-03-08 07:34:29,137 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 1403 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:29,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 3625 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9493 states. [2025-03-08 07:34:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9493 to 9185. [2025-03-08 07:34:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9185 states, 8322 states have (on average 1.5761836097092046) internal successors, (13117), 8403 states have internal predecessors, (13117), 534 states have call successors, (534), 232 states have call predecessors, (534), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 14515 transitions. [2025-03-08 07:34:29,671 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 14515 transitions. Word has length 188 [2025-03-08 07:34:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:29,671 INFO L471 AbstractCegarLoop]: Abstraction has 9185 states and 14515 transitions. [2025-03-08 07:34:29,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 14515 transitions. [2025-03-08 07:34:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:29,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:29,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:29,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:34:29,676 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:29,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1720226194, now seen corresponding path program 1 times [2025-03-08 07:34:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:29,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94566767] [2025-03-08 07:34:29,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:29,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:29,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:29,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:29,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94566767] [2025-03-08 07:34:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94566767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152366488] [2025-03-08 07:34:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:29,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:29,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:29,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:29,754 INFO L87 Difference]: Start difference. First operand 9185 states and 14515 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:30,368 INFO L93 Difference]: Finished difference Result 18879 states and 31296 transitions. [2025-03-08 07:34:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:30,393 INFO L225 Difference]: With dead ends: 18879 [2025-03-08 07:34:30,394 INFO L226 Difference]: Without dead ends: 11177 [2025-03-08 07:34:30,409 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-03-08 07:34:30,409 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1038 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:30,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1432 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2025-03-08 07:34:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 9185. [2025-03-08 07:34:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9185 states, 8322 states have (on average 1.574140831530882) internal successors, (13100), 8403 states have internal predecessors, (13100), 534 states have call successors, (534), 232 states have call predecessors, (534), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 14498 transitions. [2025-03-08 07:34:30,798 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 14498 transitions. Word has length 188 [2025-03-08 07:34:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:30,799 INFO L471 AbstractCegarLoop]: Abstraction has 9185 states and 14498 transitions. [2025-03-08 07:34:30,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 14498 transitions. [2025-03-08 07:34:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:30,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:30,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:30,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:34:30,803 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:30,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 760948399, now seen corresponding path program 1 times [2025-03-08 07:34:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:30,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481663892] [2025-03-08 07:34:30,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:30,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:30,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:30,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:30,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:30,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481663892] [2025-03-08 07:34:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481663892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:30,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891264268] [2025-03-08 07:34:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:30,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:30,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:30,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:30,880 INFO L87 Difference]: Start difference. First operand 9185 states and 14498 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:31,654 INFO L93 Difference]: Finished difference Result 18796 states and 31096 transitions. [2025-03-08 07:34:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:31,683 INFO L225 Difference]: With dead ends: 18796 [2025-03-08 07:34:31,683 INFO L226 Difference]: Without dead ends: 11094 [2025-03-08 07:34:31,694 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-03-08 07:34:31,694 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1035 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:31,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1424 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11094 states. [2025-03-08 07:34:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11094 to 9185. [2025-03-08 07:34:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9185 states, 8322 states have (on average 1.5720980533525595) internal successors, (13083), 8403 states have internal predecessors, (13083), 534 states have call successors, (534), 232 states have call predecessors, (534), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 14481 transitions. [2025-03-08 07:34:32,037 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 14481 transitions. Word has length 188 [2025-03-08 07:34:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 9185 states and 14481 transitions. [2025-03-08 07:34:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 14481 transitions. [2025-03-08 07:34:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:32,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:32,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:34:32,041 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:32,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1810817614, now seen corresponding path program 1 times [2025-03-08 07:34:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:32,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105644884] [2025-03-08 07:34:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:32,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:32,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:32,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:32,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105644884] [2025-03-08 07:34:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105644884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:32,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736137264] [2025-03-08 07:34:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:32,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:32,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:32,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:32,117 INFO L87 Difference]: Start difference. First operand 9185 states and 14481 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:32,840 INFO L93 Difference]: Finished difference Result 18713 states and 30896 transitions. [2025-03-08 07:34:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:32,864 INFO L225 Difference]: With dead ends: 18713 [2025-03-08 07:34:32,864 INFO L226 Difference]: Without dead ends: 11011 [2025-03-08 07:34:32,876 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-03-08 07:34:32,876 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 1032 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:32,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1416 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11011 states. [2025-03-08 07:34:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11011 to 9185. [2025-03-08 07:34:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9185 states, 8322 states have (on average 1.570055275174237) internal successors, (13066), 8403 states have internal predecessors, (13066), 534 states have call successors, (534), 232 states have call predecessors, (534), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 14464 transitions. [2025-03-08 07:34:33,345 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 14464 transitions. Word has length 188 [2025-03-08 07:34:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:33,345 INFO L471 AbstractCegarLoop]: Abstraction has 9185 states and 14464 transitions. [2025-03-08 07:34:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 14464 transitions. [2025-03-08 07:34:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:33,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:33,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:34:33,349 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:33,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1983231695, now seen corresponding path program 1 times [2025-03-08 07:34:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330670332] [2025-03-08 07:34:33,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:33,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:33,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:33,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:33,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:33,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330670332] [2025-03-08 07:34:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330670332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:33,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:33,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339786436] [2025-03-08 07:34:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:33,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:33,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:33,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:33,475 INFO L87 Difference]: Start difference. First operand 9185 states and 14464 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:34,889 INFO L93 Difference]: Finished difference Result 26279 states and 43658 transitions. [2025-03-08 07:34:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:34,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:34,935 INFO L225 Difference]: With dead ends: 26279 [2025-03-08 07:34:34,935 INFO L226 Difference]: Without dead ends: 18577 [2025-03-08 07:34:34,959 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-03-08 07:34:34,960 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 1374 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 3556 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:34,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 3556 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18577 states. [2025-03-08 07:34:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18577 to 18145. [2025-03-08 07:34:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18145 states, 16688 states have (on average 1.6320709491850431) internal successors, (27236), 16915 states have internal predecessors, (27236), 886 states have call successors, (886), 328 states have call predecessors, (886), 569 states have return successors, (1984), 933 states have call predecessors, (1984), 883 states have call successors, (1984) [2025-03-08 07:34:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 30106 transitions. [2025-03-08 07:34:35,640 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 30106 transitions. Word has length 188 [2025-03-08 07:34:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:35,640 INFO L471 AbstractCegarLoop]: Abstraction has 18145 states and 30106 transitions. [2025-03-08 07:34:35,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 30106 transitions. [2025-03-08 07:34:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:35,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:35,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:35,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 07:34:35,646 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 326225454, now seen corresponding path program 1 times [2025-03-08 07:34:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657208596] [2025-03-08 07:34:35,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:35,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:35,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:35,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:35,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657208596] [2025-03-08 07:34:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657208596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064581681] [2025-03-08 07:34:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:35,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:35,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:35,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:35,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:35,713 INFO L87 Difference]: Start difference. First operand 18145 states and 30106 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:36,650 INFO L93 Difference]: Finished difference Result 39707 states and 68608 transitions. [2025-03-08 07:34:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:36,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:36,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:36,708 INFO L225 Difference]: With dead ends: 39707 [2025-03-08 07:34:36,708 INFO L226 Difference]: Without dead ends: 23045 [2025-03-08 07:34:36,741 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-03-08 07:34:36,741 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 1028 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:36,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1402 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23045 states. [2025-03-08 07:34:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23045 to 18145. [2025-03-08 07:34:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18145 states, 16688 states have (on average 1.630093480345158) internal successors, (27203), 16915 states have internal predecessors, (27203), 886 states have call successors, (886), 328 states have call predecessors, (886), 569 states have return successors, (1984), 933 states have call predecessors, (1984), 883 states have call successors, (1984) [2025-03-08 07:34:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 30073 transitions. [2025-03-08 07:34:37,515 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 30073 transitions. Word has length 188 [2025-03-08 07:34:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:37,516 INFO L471 AbstractCegarLoop]: Abstraction has 18145 states and 30073 transitions. [2025-03-08 07:34:37,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 30073 transitions. [2025-03-08 07:34:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:37,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:37,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 07:34:37,521 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:37,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash -558510353, now seen corresponding path program 1 times [2025-03-08 07:34:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121873776] [2025-03-08 07:34:37,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:37,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:37,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:37,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:37,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121873776] [2025-03-08 07:34:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121873776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654329751] [2025-03-08 07:34:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:37,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:37,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:37,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:37,603 INFO L87 Difference]: Start difference. First operand 18145 states and 30073 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:39,720 INFO L93 Difference]: Finished difference Result 56341 states and 97883 transitions. [2025-03-08 07:34:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:39,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:39,838 INFO L225 Difference]: With dead ends: 56341 [2025-03-08 07:34:39,839 INFO L226 Difference]: Without dead ends: 39679 [2025-03-08 07:34:39,887 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-03-08 07:34:39,890 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1361 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:39,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3525 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39679 states. [2025-03-08 07:34:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39679 to 38981. [2025-03-08 07:34:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38981 states, 36174 states have (on average 1.6818986012052857) internal successors, (60841), 36855 states have internal predecessors, (60841), 1590 states have call successors, (1590), 520 states have call predecessors, (1590), 1215 states have return successors, (5760), 1669 states have call predecessors, (5760), 1587 states have call successors, (5760) [2025-03-08 07:34:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38981 states to 38981 states and 68191 transitions. [2025-03-08 07:34:41,466 INFO L78 Accepts]: Start accepts. Automaton has 38981 states and 68191 transitions. Word has length 188 [2025-03-08 07:34:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 38981 states and 68191 transitions. [2025-03-08 07:34:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 38981 states and 68191 transitions. [2025-03-08 07:34:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:41,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:41,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:41,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 07:34:41,477 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:41,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash -864144882, now seen corresponding path program 1 times [2025-03-08 07:34:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:41,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528616634] [2025-03-08 07:34:41,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:41,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:41,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:41,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:41,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528616634] [2025-03-08 07:34:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528616634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756874264] [2025-03-08 07:34:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:41,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:41,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:41,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:41,560 INFO L87 Difference]: Start difference. First operand 38981 states and 68191 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:44,645 INFO L93 Difference]: Finished difference Result 127895 states and 234983 transitions. [2025-03-08 07:34:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:44,927 INFO L225 Difference]: With dead ends: 127895 [2025-03-08 07:34:44,927 INFO L226 Difference]: Without dead ends: 90397 [2025-03-08 07:34:45,032 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-03-08 07:34:45,032 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 1356 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:45,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 3513 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90397 states. [2025-03-08 07:34:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90397 to 89158. [2025-03-08 07:34:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89158 states, 83165 states have (on average 1.7271328082727109) internal successors, (143637), 85240 states have internal predecessors, (143637), 2998 states have call successors, (2998), 904 states have call predecessors, (2998), 2993 states have return successors, (19456), 3141 states have call predecessors, (19456), 2995 states have call successors, (19456) [2025-03-08 07:34:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89158 states to 89158 states and 166091 transitions. [2025-03-08 07:34:49,039 INFO L78 Accepts]: Start accepts. Automaton has 89158 states and 166091 transitions. Word has length 188 [2025-03-08 07:34:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:49,039 INFO L471 AbstractCegarLoop]: Abstraction has 89158 states and 166091 transitions. [2025-03-08 07:34:49,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 89158 states and 166091 transitions. [2025-03-08 07:34:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:34:49,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:49,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:34:49,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 07:34:49,056 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:49,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1566740721, now seen corresponding path program 1 times [2025-03-08 07:34:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499591994] [2025-03-08 07:34:49,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:49,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:34:49,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:34:49,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:49,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499591994] [2025-03-08 07:34:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499591994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658450616] [2025-03-08 07:34:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:49,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:49,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:49,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:49,116 INFO L87 Difference]: Start difference. First operand 89158 states and 166091 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:34:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:54,357 INFO L93 Difference]: Finished difference Result 214046 states and 414924 transitions. [2025-03-08 07:34:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 188 [2025-03-08 07:34:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:54,768 INFO L225 Difference]: With dead ends: 214046 [2025-03-08 07:34:54,768 INFO L226 Difference]: Without dead ends: 126371 [2025-03-08 07:34:55,001 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-03-08 07:34:55,001 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 1023 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:55,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1382 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126371 states. [2025-03-08 07:35:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126371 to 89158. [2025-03-08 07:35:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89158 states, 83165 states have (on average 1.7255816749834667) internal successors, (143508), 85240 states have internal predecessors, (143508), 2998 states have call successors, (2998), 904 states have call predecessors, (2998), 2993 states have return successors, (19456), 3141 states have call predecessors, (19456), 2995 states have call successors, (19456) [2025-03-08 07:35:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89158 states to 89158 states and 165962 transitions. [2025-03-08 07:35:01,011 INFO L78 Accepts]: Start accepts. Automaton has 89158 states and 165962 transitions. Word has length 188 [2025-03-08 07:35:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:01,012 INFO L471 AbstractCegarLoop]: Abstraction has 89158 states and 165962 transitions. [2025-03-08 07:35:01,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-03-08 07:35:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 89158 states and 165962 transitions. [2025-03-08 07:35:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:35:01,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:01,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 07:35:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 07:35:01,029 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:01,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -619573778, now seen corresponding path program 1 times [2025-03-08 07:35:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:01,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810525330] [2025-03-08 07:35:01,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:01,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:35:01,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:35:01,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:01,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810525330] [2025-03-08 07:35:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810525330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029953355] [2025-03-08 07:35:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:01,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:01,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:01,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:01,291 INFO L87 Difference]: Start difference. First operand 89158 states and 165962 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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)