./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.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_1.cil-2+token_ring.11.cil-2.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 67b249d19bfb29e53a3ada528cfb44b497320fbfc38e7386ce56807633f41524 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:32:04,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:32:04,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:32:04,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:32:04,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:32:04,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:32:04,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:32:04,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:32:04,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:32:04,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:32:04,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:32:04,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:32:04,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:32:04,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:32:04,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:32:04,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:32:04,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:32:04,572 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 -> 67b249d19bfb29e53a3ada528cfb44b497320fbfc38e7386ce56807633f41524 [2025-03-08 07:32:04,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:32:04,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:32:04,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:32:04,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:32:04,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:32:04,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2025-03-08 07:32:05,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4428fb7/b3e966b88db24295af156d5d007dc16f/FLAG7242faabf [2025-03-08 07:32:06,289 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:32:06,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2025-03-08 07:32:06,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4428fb7/b3e966b88db24295af156d5d007dc16f/FLAG7242faabf [2025-03-08 07:32:06,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4428fb7/b3e966b88db24295af156d5d007dc16f [2025-03-08 07:32:06,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:32:06,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:32:06,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:32:06,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:32:06,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:32:06,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4687e745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06, skipping insertion in model container [2025-03-08 07:32:06,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:32:06,492 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_1.cil-2+token_ring.11.cil-2.c[913,926] [2025-03-08 07:32:06,536 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_1.cil-2+token_ring.11.cil-2.c[5977,5990] [2025-03-08 07:32:06,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:32:06,643 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:32:06,653 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_1.cil-2+token_ring.11.cil-2.c[913,926] [2025-03-08 07:32:06,672 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_1.cil-2+token_ring.11.cil-2.c[5977,5990] [2025-03-08 07:32:06,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:32:06,756 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:32:06,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06 WrapperNode [2025-03-08 07:32:06,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:32:06,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:32:06,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:32:06,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:32:06,763 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:32:06" (1/1) ... [2025-03-08 07:32:06,774 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:32:06" (1/1) ... [2025-03-08 07:32:06,808 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 969 [2025-03-08 07:32:06,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:32:06,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:32:06,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:32:06,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:32:06,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,849 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:32:06,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:32:06,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:32:06,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:32:06,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:32:06,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (1/1) ... [2025-03-08 07:32:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:32:06,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:06,904 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:32:06,910 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:32:06,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:32:06,925 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:32:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:32:06,925 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-08 07:32:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-08 07:32:06,926 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:32:06,926 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:32:06,926 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:32:06,926 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:32:06,926 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:32:06,926 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:32:06,926 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:32:06,927 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:32:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:32:06,927 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:32:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:32:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:32:06,927 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:32:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:32:06,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:32:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:32:06,927 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:32:07,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:32:07,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:32:07,805 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-08 07:32:07,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:32:07,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:32:07,817 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:32:07,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:07 BoogieIcfgContainer [2025-03-08 07:32:07,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:32:07,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:32:07,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:32:07,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:32:07,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:32:06" (1/3) ... [2025-03-08 07:32:07,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b484ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:07, skipping insertion in model container [2025-03-08 07:32:07,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:06" (2/3) ... [2025-03-08 07:32:07,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b484ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:07, skipping insertion in model container [2025-03-08 07:32:07,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:07" (3/3) ... [2025-03-08 07:32:07,824 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2025-03-08 07:32:07,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:32:07,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.11.cil-2.c that has 10 procedures, 423 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-03-08 07:32:07,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:32:07,899 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;@72a4dea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:32:07,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:32:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 423 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 385 states have internal predecessors, (611), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 07:32:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 07:32:07,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:07,914 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] [2025-03-08 07:32:07,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1309276947, now seen corresponding path program 1 times [2025-03-08 07:32:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124024940] [2025-03-08 07:32:07,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:07,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 07:32:08,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 07:32:08,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,123 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:32:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124024940] [2025-03-08 07:32:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124024940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553803397] [2025-03-08 07:32:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:08,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:08,145 INFO L87 Difference]: Start difference. First operand has 423 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 385 states have internal predecessors, (611), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,238 INFO L93 Difference]: Finished difference Result 877 states and 1392 transitions. [2025-03-08 07:32:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:08,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 07:32:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,257 INFO L225 Difference]: With dead ends: 877 [2025-03-08 07:32:08,257 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 07:32:08,263 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:32:08,267 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 630 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 744 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 07:32:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2025-03-08 07:32:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 417 states have (on average 1.5419664268585132) internal successors, (643), 420 states have internal predecessors, (643), 35 states have call successors, (35), 11 states have call predecessors, (35), 10 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2025-03-08 07:32:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 715 transitions. [2025-03-08 07:32:08,344 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 715 transitions. Word has length 41 [2025-03-08 07:32:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,345 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 715 transitions. [2025-03-08 07:32:08,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 715 transitions. [2025-03-08 07:32:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 07:32:08,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,347 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] [2025-03-08 07:32:08,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:32:08,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1099687032, now seen corresponding path program 1 times [2025-03-08 07:32:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046218829] [2025-03-08 07:32:08,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 07:32:08,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 07:32:08,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,455 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:32:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046218829] [2025-03-08 07:32:08,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046218829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012460264] [2025-03-08 07:32:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:08,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:08,457 INFO L87 Difference]: Start difference. First operand 464 states and 715 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,529 INFO L93 Difference]: Finished difference Result 657 states and 988 transitions. [2025-03-08 07:32:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:08,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-08 07:32:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,534 INFO L225 Difference]: With dead ends: 657 [2025-03-08 07:32:08,534 INFO L226 Difference]: Without dead ends: 550 [2025-03-08 07:32:08,534 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:32:08,535 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 66 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1283 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-08 07:32:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 525. [2025-03-08 07:32:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 472 states have (on average 1.527542372881356) internal successors, (721), 475 states have internal predecessors, (721), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (41), 36 states have call predecessors, (41), 36 states have call successors, (41) [2025-03-08 07:32:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 800 transitions. [2025-03-08 07:32:08,560 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 800 transitions. Word has length 42 [2025-03-08 07:32:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,560 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 800 transitions. [2025-03-08 07:32:08,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 800 transitions. [2025-03-08 07:32:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 07:32:08,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,564 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] [2025-03-08 07:32:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:32:08,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash -434449766, now seen corresponding path program 1 times [2025-03-08 07:32:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443531389] [2025-03-08 07:32:08,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 07:32:08,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 07:32:08,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,643 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:32:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443531389] [2025-03-08 07:32:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443531389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050968698] [2025-03-08 07:32:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:08,644 INFO L87 Difference]: Start difference. First operand 525 states and 800 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,685 INFO L93 Difference]: Finished difference Result 850 states and 1260 transitions. [2025-03-08 07:32:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 07:32:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,691 INFO L225 Difference]: With dead ends: 850 [2025-03-08 07:32:08,691 INFO L226 Difference]: Without dead ends: 682 [2025-03-08 07:32:08,692 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:32:08,695 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 618 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 724 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-08 07:32:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 670. [2025-03-08 07:32:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 599 states have (on average 1.4874791318864775) internal successors, (891), 604 states have internal predecessors, (891), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (57), 45 states have call predecessors, (57), 47 states have call successors, (57) [2025-03-08 07:32:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 997 transitions. [2025-03-08 07:32:08,734 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 997 transitions. Word has length 43 [2025-03-08 07:32:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,734 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 997 transitions. [2025-03-08 07:32:08,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 997 transitions. [2025-03-08 07:32:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:32:08,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,738 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] [2025-03-08 07:32:08,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:32:08,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -149466323, now seen corresponding path program 1 times [2025-03-08 07:32:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159089802] [2025-03-08 07:32:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:32:08,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:32:08,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,825 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:32:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159089802] [2025-03-08 07:32:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159089802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778900079] [2025-03-08 07:32:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:08,827 INFO L87 Difference]: Start difference. First operand 670 states and 997 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,862 INFO L93 Difference]: Finished difference Result 1141 states and 1653 transitions. [2025-03-08 07:32:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-03-08 07:32:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,867 INFO L225 Difference]: With dead ends: 1141 [2025-03-08 07:32:08,867 INFO L226 Difference]: Without dead ends: 828 [2025-03-08 07:32:08,867 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:32:08,870 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 53 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-08 07:32:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2025-03-08 07:32:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 735 states have (on average 1.438095238095238) internal successors, (1057), 740 states have internal predecessors, (1057), 63 states have call successors, (63), 29 states have call predecessors, (63), 28 states have return successors, (79), 59 states have call predecessors, (79), 61 states have call successors, (79) [2025-03-08 07:32:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1199 transitions. [2025-03-08 07:32:08,904 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1199 transitions. Word has length 58 [2025-03-08 07:32:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,904 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1199 transitions. [2025-03-08 07:32:08,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1199 transitions. [2025-03-08 07:32:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:08,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,908 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:32:08,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:32:08,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash -764856256, now seen corresponding path program 1 times [2025-03-08 07:32:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-08 07:32:08,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:08,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:08,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-08 07:32:09,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933400981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900248639] [2025-03-08 07:32:09,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:09,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:09,092 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:32:09,094 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:32:09,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:09,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:09,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:32:09,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:09,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900248639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:09,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:09,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:32:09,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909409588] [2025-03-08 07:32:09,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:09,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:09,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:09,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:09,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:09,254 INFO L87 Difference]: Start difference. First operand 828 states and 1199 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:32:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:09,296 INFO L93 Difference]: Finished difference Result 1330 states and 1876 transitions. [2025-03-08 07:32:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:09,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-08 07:32:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:09,301 INFO L225 Difference]: With dead ends: 1330 [2025-03-08 07:32:09,301 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 07:32:09,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:09,305 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 597 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:09,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 718 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 07:32:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2025-03-08 07:32:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 840 states have (on average 1.4095238095238096) internal successors, (1184), 845 states have internal predecessors, (1184), 71 states have call successors, (71), 35 states have call predecessors, (71), 34 states have return successors, (91), 67 states have call predecessors, (91), 69 states have call successors, (91) [2025-03-08 07:32:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1346 transitions. [2025-03-08 07:32:09,338 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1346 transitions. Word has length 63 [2025-03-08 07:32:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:09,339 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1346 transitions. [2025-03-08 07:32:09,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:32:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1346 transitions. [2025-03-08 07:32:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:09,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:09,340 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:32:09,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:32:09,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:09,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1752876387, now seen corresponding path program 1 times [2025-03-08 07:32:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060973946] [2025-03-08 07:32:09,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:09,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:09,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:09,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060973946] [2025-03-08 07:32:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060973946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730744211] [2025-03-08 07:32:09,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:09,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:09,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:09,611 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:32:09,613 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:32:09,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:09,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:09,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 07:32:09,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:09,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730744211] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:32:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 07:32:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142827293] [2025-03-08 07:32:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:32:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:32:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:32:09,817 INFO L87 Difference]: Start difference. First operand 947 states and 1346 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:09,956 INFO L93 Difference]: Finished difference Result 997 states and 1408 transitions. [2025-03-08 07:32:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-08 07:32:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:09,961 INFO L225 Difference]: With dead ends: 997 [2025-03-08 07:32:09,961 INFO L226 Difference]: Without dead ends: 994 [2025-03-08 07:32:09,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:32:09,962 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 1171 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:09,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 726 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:32:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-08 07:32:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 946. [2025-03-08 07:32:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 840 states have (on average 1.4071428571428573) internal successors, (1182), 844 states have internal predecessors, (1182), 70 states have call successors, (70), 35 states have call predecessors, (70), 34 states have return successors, (91), 67 states have call predecessors, (91), 69 states have call successors, (91) [2025-03-08 07:32:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1343 transitions. [2025-03-08 07:32:10,004 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1343 transitions. Word has length 63 [2025-03-08 07:32:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:10,004 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1343 transitions. [2025-03-08 07:32:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1343 transitions. [2025-03-08 07:32:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:32:10,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:10,009 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:32:10,015 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:32:10,213 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,SelfDestructingSolverStorable5 [2025-03-08 07:32:10,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1494872344, now seen corresponding path program 1 times [2025-03-08 07:32:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408782932] [2025-03-08 07:32:10,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:10,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:32:10,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:32:10,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:10,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:10,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408782932] [2025-03-08 07:32:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408782932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290009296] [2025-03-08 07:32:10,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:10,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:10,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:10,286 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:32:10,288 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:32:10,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:32:10,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:32:10,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:10,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:10,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:32:10,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:10,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290009296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:32:10,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:32:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-08 07:32:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852150602] [2025-03-08 07:32:10,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:32:10,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:32:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:10,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:32:10,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:10,646 INFO L87 Difference]: Start difference. First operand 946 states and 1343 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:32:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:11,035 INFO L93 Difference]: Finished difference Result 2183 states and 3020 transitions. [2025-03-08 07:32:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 07:32:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-03-08 07:32:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:11,042 INFO L225 Difference]: With dead ends: 2183 [2025-03-08 07:32:11,042 INFO L226 Difference]: Without dead ends: 1726 [2025-03-08 07:32:11,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:32:11,044 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 775 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:11,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 5011 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-03-08 07:32:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1281. [2025-03-08 07:32:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1139 states have (on average 1.3669885864793678) internal successors, (1557), 1148 states have internal predecessors, (1557), 90 states have call successors, (90), 49 states have call predecessors, (90), 50 states have return successors, (122), 84 states have call predecessors, (122), 89 states have call successors, (122) [2025-03-08 07:32:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1769 transitions. [2025-03-08 07:32:11,111 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1769 transitions. Word has length 64 [2025-03-08 07:32:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:11,112 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1769 transitions. [2025-03-08 07:32:11,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:32:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1769 transitions. [2025-03-08 07:32:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:32:11,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:11,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 07:32:11,122 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:32:11,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:11,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:11,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -532918780, now seen corresponding path program 1 times [2025-03-08 07:32:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480195013] [2025-03-08 07:32:11,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:32:11,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:32:11,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:32:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480195013] [2025-03-08 07:32:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480195013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305297220] [2025-03-08 07:32:11,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:11,383 INFO L229 MonitoredProcess]: Starting monitored process 5 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:32:11,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:32:11,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:32:11,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:32:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:32:11,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:11,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:11,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305297220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:11,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881391350] [2025-03-08 07:32:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:11,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:11,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:11,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:11,501 INFO L87 Difference]: Start difference. First operand 1281 states and 1769 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:32:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:11,555 INFO L93 Difference]: Finished difference Result 1881 states and 2564 transitions. [2025-03-08 07:32:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-03-08 07:32:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:11,560 INFO L225 Difference]: With dead ends: 1881 [2025-03-08 07:32:11,560 INFO L226 Difference]: Without dead ends: 1169 [2025-03-08 07:32:11,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:32:11,562 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 602 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:11,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 740 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-08 07:32:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1160. [2025-03-08 07:32:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1032 states have (on average 1.369186046511628) internal successors, (1413), 1042 states have internal predecessors, (1413), 82 states have call successors, (82), 43 states have call predecessors, (82), 44 states have return successors, (110), 75 states have call predecessors, (110), 81 states have call successors, (110) [2025-03-08 07:32:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1605 transitions. [2025-03-08 07:32:11,620 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1605 transitions. Word has length 82 [2025-03-08 07:32:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1605 transitions. [2025-03-08 07:32:11,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:32:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1605 transitions. [2025-03-08 07:32:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 07:32:11,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:11,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:32:11,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 07:32:11,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:11,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:11,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash 937160852, now seen corresponding path program 1 times [2025-03-08 07:32:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672698592] [2025-03-08 07:32:11,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:11,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 07:32:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672698592] [2025-03-08 07:32:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672698592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433318436] [2025-03-08 07:32:11,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:11,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:11,885 INFO L229 MonitoredProcess]: Starting monitored process 6 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:32:11,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:32:11,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:11,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:11,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 07:32:12,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433318436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:12,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578586126] [2025-03-08 07:32:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:12,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:12,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:12,011 INFO L87 Difference]: Start difference. First operand 1160 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 07:32:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:12,052 INFO L93 Difference]: Finished difference Result 1509 states and 2046 transitions. [2025-03-08 07:32:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 96 [2025-03-08 07:32:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:12,055 INFO L225 Difference]: With dead ends: 1509 [2025-03-08 07:32:12,055 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 07:32:12,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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:32:12,058 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 60 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:12,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1299 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 07:32:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-08 07:32:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.5768025078369905) internal successors, (503), 320 states have internal predecessors, (503), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 07:32:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 553 transitions. [2025-03-08 07:32:12,069 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 553 transitions. Word has length 96 [2025-03-08 07:32:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:12,069 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 553 transitions. [2025-03-08 07:32:12,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 07:32:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 553 transitions. [2025-03-08 07:32:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:12,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:12,070 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] [2025-03-08 07:32:12,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 07:32:12,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:12,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:12,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash -277906480, now seen corresponding path program 1 times [2025-03-08 07:32:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139576024] [2025-03-08 07:32:12,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:12,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:12,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:12,325 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:32:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139576024] [2025-03-08 07:32:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139576024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278990621] [2025-03-08 07:32:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:12,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:12,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:12,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:12,327 INFO L87 Difference]: Start difference. First operand 351 states and 553 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:12,342 INFO L93 Difference]: Finished difference Result 695 states and 1097 transitions. [2025-03-08 07:32:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:12,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:12,345 INFO L225 Difference]: With dead ends: 695 [2025-03-08 07:32:12,345 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 07:32:12,345 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:32:12,346 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 546 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 552 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:32:12,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 552 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 07:32:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-08 07:32:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.573667711598746) internal successors, (502), 320 states have internal predecessors, (502), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 07:32:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 552 transitions. [2025-03-08 07:32:12,357 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 552 transitions. Word has length 165 [2025-03-08 07:32:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 552 transitions. [2025-03-08 07:32:12,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 552 transitions. [2025-03-08 07:32:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:12,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:12,359 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] [2025-03-08 07:32:12,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:32:12,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:12,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -450320561, now seen corresponding path program 1 times [2025-03-08 07:32:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587985148] [2025-03-08 07:32:12,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:12,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:12,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:12,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:12,414 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:32:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587985148] [2025-03-08 07:32:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587985148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733969383] [2025-03-08 07:32:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:12,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:12,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:12,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:12,417 INFO L87 Difference]: Start difference. First operand 351 states and 552 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:12,432 INFO L93 Difference]: Finished difference Result 687 states and 1080 transitions. [2025-03-08 07:32:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:12,434 INFO L225 Difference]: With dead ends: 687 [2025-03-08 07:32:12,434 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 07:32:12,435 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:32:12,436 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 537 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 551 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:32:12,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 551 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 07:32:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-08 07:32:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.5705329153605017) internal successors, (501), 320 states have internal predecessors, (501), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 07:32:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 551 transitions. [2025-03-08 07:32:12,449 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 551 transitions. Word has length 165 [2025-03-08 07:32:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 551 transitions. [2025-03-08 07:32:12,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 551 transitions. [2025-03-08 07:32:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:12,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:12,452 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] [2025-03-08 07:32:12,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:32:12,453 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:12,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -643251762, now seen corresponding path program 1 times [2025-03-08 07:32:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937298304] [2025-03-08 07:32:12,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:12,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:12,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:12,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:12,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:12,576 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:32:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937298304] [2025-03-08 07:32:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937298304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774919701] [2025-03-08 07:32:12,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:12,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:12,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:12,579 INFO L87 Difference]: Start difference. First operand 351 states and 551 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:13,036 INFO L93 Difference]: Finished difference Result 1057 states and 1679 transitions. [2025-03-08 07:32:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:13,040 INFO L225 Difference]: With dead ends: 1057 [2025-03-08 07:32:13,040 INFO L226 Difference]: Without dead ends: 726 [2025-03-08 07:32:13,041 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:32:13,041 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 1063 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:13,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1515 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-08 07:32:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 699. [2025-03-08 07:32:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 640 states have (on average 1.584375) internal successors, (1014), 642 states have internal predecessors, (1014), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 07:32:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1105 transitions. [2025-03-08 07:32:13,066 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1105 transitions. Word has length 165 [2025-03-08 07:32:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:13,066 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1105 transitions. [2025-03-08 07:32:13,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1105 transitions. [2025-03-08 07:32:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:13,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:13,067 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] [2025-03-08 07:32:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:32:13,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -218151152, now seen corresponding path program 1 times [2025-03-08 07:32:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531929191] [2025-03-08 07:32:13,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:13,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:13,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:13,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:13,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:13,213 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:32:13,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531929191] [2025-03-08 07:32:13,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531929191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:13,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:13,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:13,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137453000] [2025-03-08 07:32:13,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:13,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:13,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:13,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:13,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:13,215 INFO L87 Difference]: Start difference. First operand 699 states and 1105 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:13,867 INFO L93 Difference]: Finished difference Result 1824 states and 2920 transitions. [2025-03-08 07:32:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:13,873 INFO L225 Difference]: With dead ends: 1824 [2025-03-08 07:32:13,873 INFO L226 Difference]: Without dead ends: 1145 [2025-03-08 07:32:13,875 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:32:13,875 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 1071 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 2921 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:13,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 2921 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-08 07:32:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1022. [2025-03-08 07:32:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 936 states have (on average 1.577991452991453) internal successors, (1477), 939 states have internal predecessors, (1477), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-08 07:32:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1611 transitions. [2025-03-08 07:32:13,910 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1611 transitions. Word has length 165 [2025-03-08 07:32:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:13,910 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1611 transitions. [2025-03-08 07:32:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1611 transitions. [2025-03-08 07:32:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:13,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:13,912 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] [2025-03-08 07:32:13,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:32:13,912 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:13,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1659117743, now seen corresponding path program 1 times [2025-03-08 07:32:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500787722] [2025-03-08 07:32:13,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:13,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:14,050 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:32:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500787722] [2025-03-08 07:32:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500787722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:14,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:14,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898157438] [2025-03-08 07:32:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:14,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:14,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:14,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:14,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:14,053 INFO L87 Difference]: Start difference. First operand 1022 states and 1611 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:14,701 INFO L93 Difference]: Finished difference Result 2857 states and 4565 transitions. [2025-03-08 07:32:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:14,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:14,708 INFO L225 Difference]: With dead ends: 2857 [2025-03-08 07:32:14,708 INFO L226 Difference]: Without dead ends: 1855 [2025-03-08 07:32:14,711 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:32:14,712 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1066 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:14,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 2905 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2025-03-08 07:32:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1713. [2025-03-08 07:32:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1571 states have (on average 1.5824315722469764) internal successors, (2486), 1578 states have internal predecessors, (2486), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-08 07:32:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2712 transitions. [2025-03-08 07:32:14,792 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2712 transitions. Word has length 165 [2025-03-08 07:32:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:14,793 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2712 transitions. [2025-03-08 07:32:14,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2712 transitions. [2025-03-08 07:32:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:14,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:14,795 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] [2025-03-08 07:32:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:32:14,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1581127472, now seen corresponding path program 1 times [2025-03-08 07:32:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759724195] [2025-03-08 07:32:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:14,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:14,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:14,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:14,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:14,923 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:32:14,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:14,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759724195] [2025-03-08 07:32:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759724195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:14,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:14,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696705551] [2025-03-08 07:32:14,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:14,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:14,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:14,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:14,924 INFO L87 Difference]: Start difference. First operand 1713 states and 2712 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:15,577 INFO L93 Difference]: Finished difference Result 5098 states and 8208 transitions. [2025-03-08 07:32:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:15,589 INFO L225 Difference]: With dead ends: 5098 [2025-03-08 07:32:15,589 INFO L226 Difference]: Without dead ends: 3405 [2025-03-08 07:32:15,593 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:32:15,593 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 1061 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:15,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 2893 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-08 07:32:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3224. [2025-03-08 07:32:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3224 states, 2964 states have (on average 1.5998650472334683) internal successors, (4742), 2985 states have internal predecessors, (4742), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-08 07:32:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 5176 transitions. [2025-03-08 07:32:15,703 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 5176 transitions. Word has length 165 [2025-03-08 07:32:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:15,704 INFO L471 AbstractCegarLoop]: Abstraction has 3224 states and 5176 transitions. [2025-03-08 07:32:15,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 5176 transitions. [2025-03-08 07:32:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:15,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:15,706 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] [2025-03-08 07:32:15,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:32:15,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:15,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash -361050993, now seen corresponding path program 1 times [2025-03-08 07:32:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572427839] [2025-03-08 07:32:15,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:15,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:15,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:15,831 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:32:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572427839] [2025-03-08 07:32:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572427839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598844386] [2025-03-08 07:32:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:15,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:15,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:15,833 INFO L87 Difference]: Start difference. First operand 3224 states and 5176 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:16,650 INFO L93 Difference]: Finished difference Result 10077 states and 16530 transitions. [2025-03-08 07:32:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:16,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:16,674 INFO L225 Difference]: With dead ends: 10077 [2025-03-08 07:32:16,675 INFO L226 Difference]: Without dead ends: 6873 [2025-03-08 07:32:16,681 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:32:16,682 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1056 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:16,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 2881 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2025-03-08 07:32:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 6615. [2025-03-08 07:32:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6101 states have (on average 1.6282576626782495) internal successors, (9934), 6168 states have internal predecessors, (9934), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 07:32:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 10880 transitions. [2025-03-08 07:32:16,901 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 10880 transitions. Word has length 165 [2025-03-08 07:32:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:16,901 INFO L471 AbstractCegarLoop]: Abstraction has 6615 states and 10880 transitions. [2025-03-08 07:32:16,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 10880 transitions. [2025-03-08 07:32:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:16,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:16,905 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] [2025-03-08 07:32:16,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:32:16,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1254985904, now seen corresponding path program 1 times [2025-03-08 07:32:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684629207] [2025-03-08 07:32:16,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:16,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:16,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:16,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:16,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:17,061 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:32:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684629207] [2025-03-08 07:32:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684629207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440505681] [2025-03-08 07:32:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:17,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:17,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:17,064 INFO L87 Difference]: Start difference. First operand 6615 states and 10880 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:17,545 INFO L93 Difference]: Finished difference Result 14787 states and 24925 transitions. [2025-03-08 07:32:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:17,582 INFO L225 Difference]: With dead ends: 14787 [2025-03-08 07:32:17,582 INFO L226 Difference]: Without dead ends: 8192 [2025-03-08 07:32:17,599 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:32:17,599 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 746 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:17,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1073 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:32:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8192 states. [2025-03-08 07:32:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8192 to 6615. [2025-03-08 07:32:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6101 states have (on average 1.6254712342238977) internal successors, (9917), 6168 states have internal predecessors, (9917), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 07:32:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 10863 transitions. [2025-03-08 07:32:17,900 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 10863 transitions. Word has length 165 [2025-03-08 07:32:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:17,900 INFO L471 AbstractCegarLoop]: Abstraction has 6615 states and 10863 transitions. [2025-03-08 07:32:17,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 10863 transitions. [2025-03-08 07:32:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:17,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:17,905 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] [2025-03-08 07:32:17,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:32:17,905 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:17,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1220161967, now seen corresponding path program 1 times [2025-03-08 07:32:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:17,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847300015] [2025-03-08 07:32:17,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:17,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:17,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:17,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:17,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:18,022 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:32:18,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847300015] [2025-03-08 07:32:18,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847300015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:18,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:18,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663137985] [2025-03-08 07:32:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:18,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:18,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:18,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:18,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:18,025 INFO L87 Difference]: Start difference. First operand 6615 states and 10863 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:18,573 INFO L93 Difference]: Finished difference Result 14704 states and 24725 transitions. [2025-03-08 07:32:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:18,605 INFO L225 Difference]: With dead ends: 14704 [2025-03-08 07:32:18,605 INFO L226 Difference]: Without dead ends: 8109 [2025-03-08 07:32:18,620 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:32:18,621 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 743 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:18,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1065 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:32:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2025-03-08 07:32:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 6615. [2025-03-08 07:32:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6101 states have (on average 1.622684805769546) internal successors, (9900), 6168 states have internal predecessors, (9900), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 07:32:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 10846 transitions. [2025-03-08 07:32:18,858 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 10846 transitions. Word has length 165 [2025-03-08 07:32:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:18,858 INFO L471 AbstractCegarLoop]: Abstraction has 6615 states and 10846 transitions. [2025-03-08 07:32:18,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 10846 transitions. [2025-03-08 07:32:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:18,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:18,863 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] [2025-03-08 07:32:18,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:32:18,863 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:18,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1136266032, now seen corresponding path program 1 times [2025-03-08 07:32:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:18,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490229686] [2025-03-08 07:32:18,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:18,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:18,996 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:32:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490229686] [2025-03-08 07:32:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490229686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995227808] [2025-03-08 07:32:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:18,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:18,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:18,999 INFO L87 Difference]: Start difference. First operand 6615 states and 10846 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:19,910 INFO L93 Difference]: Finished difference Result 21152 states and 35558 transitions. [2025-03-08 07:32:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:19,959 INFO L225 Difference]: With dead ends: 21152 [2025-03-08 07:32:19,959 INFO L226 Difference]: Without dead ends: 14557 [2025-03-08 07:32:19,978 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:32:19,978 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 1032 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:19,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 2817 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14557 states. [2025-03-08 07:32:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14557 to 14207. [2025-03-08 07:32:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14207 states, 13131 states have (on average 1.6527301804889194) internal successors, (21702), 13344 states have internal predecessors, (21702), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 07:32:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14207 states to 14207 states and 24056 transitions. [2025-03-08 07:32:20,737 INFO L78 Accepts]: Start accepts. Automaton has 14207 states and 24056 transitions. Word has length 165 [2025-03-08 07:32:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:20,738 INFO L471 AbstractCegarLoop]: Abstraction has 14207 states and 24056 transitions. [2025-03-08 07:32:20,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 14207 states and 24056 transitions. [2025-03-08 07:32:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:20,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:20,745 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] [2025-03-08 07:32:20,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:32:20,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -311740815, now seen corresponding path program 1 times [2025-03-08 07:32:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199955922] [2025-03-08 07:32:20,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:20,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:20,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:20,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:20,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:20,860 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:32:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:20,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199955922] [2025-03-08 07:32:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199955922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:20,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673951331] [2025-03-08 07:32:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:20,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:20,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:20,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:20,863 INFO L87 Difference]: Start difference. First operand 14207 states and 24056 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:21,543 INFO L93 Difference]: Finished difference Result 32314 states and 56277 transitions. [2025-03-08 07:32:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:21,604 INFO L225 Difference]: With dead ends: 32314 [2025-03-08 07:32:21,604 INFO L226 Difference]: Without dead ends: 18127 [2025-03-08 07:32:21,638 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:32:21,639 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 739 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:21,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1051 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2025-03-08 07:32:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 14207. [2025-03-08 07:32:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14207 states, 13131 states have (on average 1.6502170436371943) internal successors, (21669), 13344 states have internal predecessors, (21669), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 07:32:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14207 states to 14207 states and 24023 transitions. [2025-03-08 07:32:22,221 INFO L78 Accepts]: Start accepts. Automaton has 14207 states and 24023 transitions. Word has length 165 [2025-03-08 07:32:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:22,221 INFO L471 AbstractCegarLoop]: Abstraction has 14207 states and 24023 transitions. [2025-03-08 07:32:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14207 states and 24023 transitions. [2025-03-08 07:32:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:22,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:22,228 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] [2025-03-08 07:32:22,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:32:22,229 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:22,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1027022608, now seen corresponding path program 1 times [2025-03-08 07:32:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012212242] [2025-03-08 07:32:22,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:22,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:22,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:22,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:22,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:22,343 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:32:22,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012212242] [2025-03-08 07:32:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012212242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356281596] [2025-03-08 07:32:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:22,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:22,345 INFO L87 Difference]: Start difference. First operand 14207 states and 24023 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:24,046 INFO L93 Difference]: Finished difference Result 46398 states and 81063 transitions. [2025-03-08 07:32:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:24,172 INFO L225 Difference]: With dead ends: 46398 [2025-03-08 07:32:24,172 INFO L226 Difference]: Without dead ends: 32211 [2025-03-08 07:32:24,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:32:24,220 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1019 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:24,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2786 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32211 states. [2025-03-08 07:32:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32211 to 31659. [2025-03-08 07:32:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31659 states, 29297 states have (on average 1.6819128238386183) internal successors, (49275), 29964 states have internal predecessors, (49275), 1305 states have call successors, (1305), 390 states have call predecessors, (1305), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-03-08 07:32:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31659 states to 31659 states and 55981 transitions. [2025-03-08 07:32:25,550 INFO L78 Accepts]: Start accepts. Automaton has 31659 states and 55981 transitions. Word has length 165 [2025-03-08 07:32:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:25,551 INFO L471 AbstractCegarLoop]: Abstraction has 31659 states and 55981 transitions. [2025-03-08 07:32:25,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 31659 states and 55981 transitions. [2025-03-08 07:32:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:25,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:25,561 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] [2025-03-08 07:32:25,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:32:25,562 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:25,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1208755857, now seen corresponding path program 1 times [2025-03-08 07:32:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225475050] [2025-03-08 07:32:25,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:25,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:25,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:25,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:25,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:25,670 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:32:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225475050] [2025-03-08 07:32:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225475050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172351284] [2025-03-08 07:32:25,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:25,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:25,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:25,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:25,671 INFO L87 Difference]: Start difference. First operand 31659 states and 55981 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:28,247 INFO L93 Difference]: Finished difference Result 105728 states and 195539 transitions. [2025-03-08 07:32:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:28,548 INFO L225 Difference]: With dead ends: 105728 [2025-03-08 07:32:28,549 INFO L226 Difference]: Without dead ends: 74089 [2025-03-08 07:32:28,652 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:32:28,653 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1014 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:28,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 2774 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74089 states. [2025-03-08 07:32:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74089 to 73124. [2025-03-08 07:32:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73124 states, 67704 states have (on average 1.7150980739690418) internal successors, (116119), 69765 states have internal predecessors, (116119), 2585 states have call successors, (2585), 774 states have call predecessors, (2585), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-03-08 07:32:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73124 states to 73124 states and 137673 transitions. [2025-03-08 07:32:32,344 INFO L78 Accepts]: Start accepts. Automaton has 73124 states and 137673 transitions. Word has length 165 [2025-03-08 07:32:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:32,344 INFO L471 AbstractCegarLoop]: Abstraction has 73124 states and 137673 transitions. [2025-03-08 07:32:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 73124 states and 137673 transitions. [2025-03-08 07:32:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:32:32,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:32,359 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] [2025-03-08 07:32:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:32:32,360 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1353165552, now seen corresponding path program 1 times [2025-03-08 07:32:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:32,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190188481] [2025-03-08 07:32:32,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:32,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:32,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:32:32,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:32:32,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:32,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:32,442 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:32:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190188481] [2025-03-08 07:32:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190188481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:32,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335619741] [2025-03-08 07:32:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:32,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:32,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:32,444 INFO L87 Difference]: Start difference. First operand 73124 states and 137673 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:32:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:39,702 INFO L93 Difference]: Finished difference Result 259609 states and 514862 transitions. [2025-03-08 07:32:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:39,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:32:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:40,443 INFO L225 Difference]: With dead ends: 259609 [2025-03-08 07:32:40,443 INFO L226 Difference]: Without dead ends: 186505 [2025-03-08 07:32:40,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:32:40,757 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 1353 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:40,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 2749 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186505 states.