./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d55d399b7f413c968459e57be858565c9c3a03797404fd2613513b79af9aeb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:31:52,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:31:52,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:31:52,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:31:52,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:31:52,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:31:52,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:31:52,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:31:52,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:31:52,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:31:52,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:31:52,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:31:52,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:31:52,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:31:52,505 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:31:52,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:31:52,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:31:52,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:31:52,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:31:52,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:31:52,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:31:52,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:52,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:31:52,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:31:52,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:31:52,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:31:52,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:31:52,508 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 -> 6d55d399b7f413c968459e57be858565c9c3a03797404fd2613513b79af9aeb3 [2025-03-08 07:31:52,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:31:52,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:31:52,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:31:52,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:31:52,772 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:31:52,774 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.09.cil-1.c [2025-03-08 07:31:54,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe6037e4/8733c1751dc546f2b43d397c4ff6b8cf/FLAGdf5ed76c6 [2025-03-08 07:31:54,333 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:31:54,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2025-03-08 07:31:54,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe6037e4/8733c1751dc546f2b43d397c4ff6b8cf/FLAGdf5ed76c6 [2025-03-08 07:31:54,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe6037e4/8733c1751dc546f2b43d397c4ff6b8cf [2025-03-08 07:31:54,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:31:54,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:31:54,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:54,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:31:54,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:31:54,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebb8831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54, skipping insertion in model container [2025-03-08 07:31:54,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:31:54,523 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.09.cil-1.c[913,926] [2025-03-08 07:31:54,576 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.09.cil-1.c[5977,5990] [2025-03-08 07:31:54,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:54,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:31:54,709 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.09.cil-1.c[913,926] [2025-03-08 07:31:54,724 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.09.cil-1.c[5977,5990] [2025-03-08 07:31:54,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:54,786 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:31:54,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54 WrapperNode [2025-03-08 07:31:54,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:54,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:54,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:31:54,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:31:54,793 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:31:54" (1/1) ... [2025-03-08 07:31:54,806 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:31:54" (1/1) ... [2025-03-08 07:31:54,852 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 855 [2025-03-08 07:31:54,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:54,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:31:54,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:31:54,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:31:54,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,888 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:31:54,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:31:54,922 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:31:54,922 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:31:54,922 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:31:54,923 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (1/1) ... [2025-03-08 07:31:54,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:54,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:54,947 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:31:54,953 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:31:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:31:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:31:54,970 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:31:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-08 07:31:54,970 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-08 07:31:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:31:54,970 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:31:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:31:54,971 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:31:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:31:54,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:31:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:31:54,971 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:31:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:31:54,971 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:31:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:31:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:31:54,972 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:31:54,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:31:54,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:31:54,972 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:31:54,972 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:31:55,069 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:31:55,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:31:55,847 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-03-08 07:31:55,848 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:31:55,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:31:55,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:31:55,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:55 BoogieIcfgContainer [2025-03-08 07:31:55,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:31:55,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:31:55,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:31:55,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:31:55,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:31:54" (1/3) ... [2025-03-08 07:31:55,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bac16f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:55, skipping insertion in model container [2025-03-08 07:31:55,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:54" (2/3) ... [2025-03-08 07:31:55,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bac16f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:55, skipping insertion in model container [2025-03-08 07:31:55,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:55" (3/3) ... [2025-03-08 07:31:55,878 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2025-03-08 07:31:55,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:31:55,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.09.cil-1.c that has 10 procedures, 373 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-08 07:31:55,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:31:55,959 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;@63eff71d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:31:55,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:31:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 373 states, 334 states have (on average 1.589820359281437) internal successors, (531), 337 states have internal predecessors, (531), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 07:31:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 07:31:55,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:55,970 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:31:55,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2056248837, now seen corresponding path program 1 times [2025-03-08 07:31:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598483351] [2025-03-08 07:31:55,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:56,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 07:31:56,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 07:31:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:56,193 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:31:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598483351] [2025-03-08 07:31:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598483351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796989489] [2025-03-08 07:31:56,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:56,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:56,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:56,218 INFO L87 Difference]: Start difference. First operand has 373 states, 334 states have (on average 1.589820359281437) internal successors, (531), 337 states have internal predecessors, (531), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) 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:31:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:56,316 INFO L93 Difference]: Finished difference Result 779 states and 1228 transitions. [2025-03-08 07:31:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:56,318 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:31:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:56,328 INFO L225 Difference]: With dead ends: 779 [2025-03-08 07:31:56,332 INFO L226 Difference]: Without dead ends: 418 [2025-03-08 07:31:56,338 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:31:56,341 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 549 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 662 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:31:56,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 662 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-08 07:31:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2025-03-08 07:31:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 369 states have (on average 1.5311653116531165) internal successors, (565), 372 states have internal predecessors, (565), 33 states have call successors, (33), 11 states have call predecessors, (33), 10 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) [2025-03-08 07:31:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 633 transitions. [2025-03-08 07:31:56,414 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 633 transitions. Word has length 41 [2025-03-08 07:31:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:56,415 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 633 transitions. [2025-03-08 07:31:56,415 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:31:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 633 transitions. [2025-03-08 07:31:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 07:31:56,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:56,418 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:31:56,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:31:56,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:56,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1177723430, now seen corresponding path program 1 times [2025-03-08 07:31:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850878608] [2025-03-08 07:31:56,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:56,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 07:31:56,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 07:31:56,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:56,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:56,503 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:31:56,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850878608] [2025-03-08 07:31:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850878608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190941429] [2025-03-08 07:31:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:56,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:56,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:56,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:56,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:56,505 INFO L87 Difference]: Start difference. First operand 414 states and 633 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:31:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:56,586 INFO L93 Difference]: Finished difference Result 607 states and 906 transitions. [2025-03-08 07:31:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:56,587 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:31:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:56,590 INFO L225 Difference]: With dead ends: 607 [2025-03-08 07:31:56,590 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 07:31:56,594 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:31:56,594 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 66 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1119 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:31:56,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 07:31:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 475. [2025-03-08 07:31:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 424 states have (on average 1.5165094339622642) internal successors, (643), 427 states have internal predecessors, (643), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (39), 34 states have call predecessors, (39), 34 states have call successors, (39) [2025-03-08 07:31:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 718 transitions. [2025-03-08 07:31:56,626 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 718 transitions. Word has length 42 [2025-03-08 07:31:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:56,627 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 718 transitions. [2025-03-08 07:31:56,627 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:31:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 718 transitions. [2025-03-08 07:31:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 07:31:56,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:56,631 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:31:56,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:31:56,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:56,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -550960216, now seen corresponding path program 1 times [2025-03-08 07:31:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465973558] [2025-03-08 07:31:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:56,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 07:31:56,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 07:31:56,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:56,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:56,718 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:31:56,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465973558] [2025-03-08 07:31:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465973558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:56,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:56,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251176131] [2025-03-08 07:31:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:56,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:56,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:56,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:56,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:56,720 INFO L87 Difference]: Start difference. First operand 475 states and 718 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:31:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:56,759 INFO L93 Difference]: Finished difference Result 800 states and 1178 transitions. [2025-03-08 07:31:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:56,760 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:31:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:56,766 INFO L225 Difference]: With dead ends: 800 [2025-03-08 07:31:56,766 INFO L226 Difference]: Without dead ends: 632 [2025-03-08 07:31:56,767 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:31:56,768 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 536 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 642 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:31:56,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 642 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-08 07:31:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2025-03-08 07:31:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 551 states have (on average 1.4754990925589837) internal successors, (813), 556 states have internal predecessors, (813), 47 states have call successors, (47), 21 states have call predecessors, (47), 20 states have return successors, (55), 43 states have call predecessors, (55), 45 states have call successors, (55) [2025-03-08 07:31:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 915 transitions. [2025-03-08 07:31:56,795 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 915 transitions. Word has length 43 [2025-03-08 07:31:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:56,796 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 915 transitions. [2025-03-08 07:31:56,796 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:31:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 915 transitions. [2025-03-08 07:31:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:31:56,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:56,797 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:31:56,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:31:56,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:56,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 854064219, now seen corresponding path program 1 times [2025-03-08 07:31:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986238631] [2025-03-08 07:31:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:31:56,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:31:56,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:56,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:56,917 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:31:56,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:56,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986238631] [2025-03-08 07:31:56,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986238631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:56,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:56,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:56,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648491958] [2025-03-08 07:31:56,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:56,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:56,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:56,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:56,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:56,918 INFO L87 Difference]: Start difference. First operand 620 states and 915 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:31:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:56,964 INFO L93 Difference]: Finished difference Result 1091 states and 1571 transitions. [2025-03-08 07:31:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:56,965 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:31:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:56,968 INFO L225 Difference]: With dead ends: 1091 [2025-03-08 07:31:56,968 INFO L226 Difference]: Without dead ends: 778 [2025-03-08 07:31:56,969 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:31:56,970 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 53 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1163 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:31:56,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1163 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-03-08 07:31:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2025-03-08 07:31:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 687 states have (on average 1.4250363901018923) internal successors, (979), 692 states have internal predecessors, (979), 61 states have call successors, (61), 29 states have call predecessors, (61), 28 states have return successors, (77), 57 states have call predecessors, (77), 59 states have call successors, (77) [2025-03-08 07:31:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1117 transitions. [2025-03-08 07:31:57,026 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1117 transitions. Word has length 58 [2025-03-08 07:31:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:57,026 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1117 transitions. [2025-03-08 07:31:57,026 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:31:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1117 transitions. [2025-03-08 07:31:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:31:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:57,030 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:31:57,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:31:57,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 81824238, now seen corresponding path program 1 times [2025-03-08 07:31:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948607689] [2025-03-08 07:31:57,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:57,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:57,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:57,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:57,185 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:31:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948607689] [2025-03-08 07:31:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948607689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061214132] [2025-03-08 07:31:57,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:57,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:57,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:57,189 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:31:57,190 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:31:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:57,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:57,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:57,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:31:57,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:57,358 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:31:57,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:57,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061214132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:57,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:57,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:31:57,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461926082] [2025-03-08 07:31:57,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:57,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:57,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:57,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:57,362 INFO L87 Difference]: Start difference. First operand 778 states and 1117 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:31:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:57,403 INFO L93 Difference]: Finished difference Result 1280 states and 1794 transitions. [2025-03-08 07:31:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:57,404 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:31:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:57,410 INFO L225 Difference]: With dead ends: 1280 [2025-03-08 07:31:57,410 INFO L226 Difference]: Without dead ends: 897 [2025-03-08 07:31:57,411 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:31:57,411 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 515 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 636 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:31:57,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 636 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-08 07:31:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2025-03-08 07:31:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 792 states have (on average 1.3964646464646464) internal successors, (1106), 797 states have internal predecessors, (1106), 69 states have call successors, (69), 35 states have call predecessors, (69), 34 states have return successors, (89), 65 states have call predecessors, (89), 67 states have call successors, (89) [2025-03-08 07:31:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1264 transitions. [2025-03-08 07:31:57,470 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1264 transitions. Word has length 63 [2025-03-08 07:31:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:57,470 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1264 transitions. [2025-03-08 07:31:57,470 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:31:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1264 transitions. [2025-03-08 07:31:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:31:57,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:57,473 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:31:57,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:31:57,677 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:31:57,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:57,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash -906195893, now seen corresponding path program 1 times [2025-03-08 07:31:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:57,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174028136] [2025-03-08 07:31:57,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:57,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:57,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:57,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:57,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:57,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:57,784 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:31:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174028136] [2025-03-08 07:31:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174028136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184811189] [2025-03-08 07:31:57,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:57,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:57,788 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:31:57,791 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:31:57,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:57,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:57,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:57,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 07:31:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:57,958 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:31:57,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:31:58,001 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:31:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184811189] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:31:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 07:31:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37395859] [2025-03-08 07:31:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:58,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:31:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:58,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:31:58,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:31:58,003 INFO L87 Difference]: Start difference. First operand 897 states and 1264 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:31:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:58,163 INFO L93 Difference]: Finished difference Result 947 states and 1326 transitions. [2025-03-08 07:31:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:31:58,164 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:31:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:58,168 INFO L225 Difference]: With dead ends: 947 [2025-03-08 07:31:58,168 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 07:31:58,169 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:31:58,169 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1015 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:58,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 644 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:31:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 07:31:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 896. [2025-03-08 07:31:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 792 states have (on average 1.393939393939394) internal successors, (1104), 796 states have internal predecessors, (1104), 68 states have call successors, (68), 35 states have call predecessors, (68), 34 states have return successors, (89), 65 states have call predecessors, (89), 67 states have call successors, (89) [2025-03-08 07:31:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1261 transitions. [2025-03-08 07:31:58,239 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1261 transitions. Word has length 63 [2025-03-08 07:31:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:58,239 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1261 transitions. [2025-03-08 07:31:58,239 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:31:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1261 transitions. [2025-03-08 07:31:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:31:58,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:58,241 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:31:58,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:31:58,446 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:31:58,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1972224870, now seen corresponding path program 1 times [2025-03-08 07:31:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089393992] [2025-03-08 07:31:58,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:58,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:31:58,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:31:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:58,526 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:31:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089393992] [2025-03-08 07:31:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089393992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367144047] [2025-03-08 07:31:58,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:58,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:58,529 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:31:58,531 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:31:58,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:31:58,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:31:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:58,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:31:58,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:58,859 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:31:58,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:31:58,930 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:31:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367144047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:31:58,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:31:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-08 07:31:58,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892045264] [2025-03-08 07:31:58,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:31:58,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:31:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:31:58,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:58,933 INFO L87 Difference]: Start difference. First operand 896 states and 1261 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:31:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:59,373 INFO L93 Difference]: Finished difference Result 2133 states and 2938 transitions. [2025-03-08 07:31:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 07:31:59,374 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:31:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:59,383 INFO L225 Difference]: With dead ends: 2133 [2025-03-08 07:31:59,383 INFO L226 Difference]: Without dead ends: 1676 [2025-03-08 07:31:59,391 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:31:59,392 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 724 mSDsluCounter, 3737 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:59,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 4379 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:31:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-03-08 07:31:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1231. [2025-03-08 07:31:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1091 states have (on average 1.3556370302474794) internal successors, (1479), 1100 states have internal predecessors, (1479), 88 states have call successors, (88), 49 states have call predecessors, (88), 50 states have return successors, (120), 82 states have call predecessors, (120), 87 states have call successors, (120) [2025-03-08 07:31:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1687 transitions. [2025-03-08 07:31:59,470 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1687 transitions. Word has length 64 [2025-03-08 07:31:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:59,470 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1687 transitions. [2025-03-08 07:31:59,470 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:31:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1687 transitions. [2025-03-08 07:31:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:31:59,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:59,473 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:31:59,480 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:31:59,673 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:31:59,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:59,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1088909390, now seen corresponding path program 1 times [2025-03-08 07:31:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534968725] [2025-03-08 07:31:59,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:59,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:31:59,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:31:59,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:59,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:59,748 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:31:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534968725] [2025-03-08 07:31:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534968725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323164979] [2025-03-08 07:31:59,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:59,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:59,750 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:31:59,752 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:31:59,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:31:59,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:31:59,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:59,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:59,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:31:59,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:59,871 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:31:59,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323164979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:59,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:31:59,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969712827] [2025-03-08 07:31:59,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:59,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:59,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:59,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:59,873 INFO L87 Difference]: Start difference. First operand 1231 states and 1687 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:31:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:59,917 INFO L93 Difference]: Finished difference Result 1831 states and 2482 transitions. [2025-03-08 07:31:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:59,917 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:31:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:59,922 INFO L225 Difference]: With dead ends: 1831 [2025-03-08 07:31:59,922 INFO L226 Difference]: Without dead ends: 1119 [2025-03-08 07:31:59,924 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:31:59,924 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 520 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 658 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:31:59,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 658 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-03-08 07:31:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1110. [2025-03-08 07:31:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 984 states have (on average 1.3567073170731707) internal successors, (1335), 994 states have internal predecessors, (1335), 80 states have call successors, (80), 43 states have call predecessors, (80), 44 states have return successors, (108), 73 states have call predecessors, (108), 79 states have call successors, (108) [2025-03-08 07:31:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1523 transitions. [2025-03-08 07:31:59,967 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1523 transitions. Word has length 82 [2025-03-08 07:31:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:59,968 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1523 transitions. [2025-03-08 07:31:59,968 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:31:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1523 transitions. [2025-03-08 07:31:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 07:31:59,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:59,970 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:31:59,977 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:00,175 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:00,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:00,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1326947646, now seen corresponding path program 1 times [2025-03-08 07:32:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207736739] [2025-03-08 07:32:00,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:00,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:00,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:00,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,238 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:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207736739] [2025-03-08 07:32:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207736739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825519269] [2025-03-08 07:32:00,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:00,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:00,241 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:00,243 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:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:00,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:00,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:00,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:00,360 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:00,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825519269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:00,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:00,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339249951] [2025-03-08 07:32:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:00,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:00,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:00,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:00,362 INFO L87 Difference]: Start difference. First operand 1110 states and 1523 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:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:00,402 INFO L93 Difference]: Finished difference Result 1459 states and 1964 transitions. [2025-03-08 07:32:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:00,403 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:00,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:00,406 INFO L225 Difference]: With dead ends: 1459 [2025-03-08 07:32:00,406 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 07:32:00,408 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:00,408 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 60 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1135 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:00,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1135 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:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 07:32:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-03-08 07:32:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.5682656826568266) internal successors, (425), 272 states have internal predecessors, (425), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 07:32:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 471 transitions. [2025-03-08 07:32:00,421 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 471 transitions. Word has length 96 [2025-03-08 07:32:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:00,421 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 471 transitions. [2025-03-08 07:32:00,421 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:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 471 transitions. [2025-03-08 07:32:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:00,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:00,422 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] [2025-03-08 07:32:00,429 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:00,622 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:00,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -964803233, now seen corresponding path program 1 times [2025-03-08 07:32:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139645056] [2025-03-08 07:32:00,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:00,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,674 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:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:00,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139645056] [2025-03-08 07:32:00,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139645056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:00,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964481271] [2025-03-08 07:32:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:00,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:00,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:00,676 INFO L87 Difference]: Start difference. First operand 301 states and 471 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:00,692 INFO L93 Difference]: Finished difference Result 588 states and 919 transitions. [2025-03-08 07:32:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:00,694 INFO L225 Difference]: With dead ends: 588 [2025-03-08 07:32:00,694 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 07:32:00,695 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:00,695 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 457 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 470 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:00,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 470 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:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 07:32:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-03-08 07:32:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.5645756457564575) internal successors, (424), 272 states have internal predecessors, (424), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 07:32:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 470 transitions. [2025-03-08 07:32:00,708 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 470 transitions. Word has length 143 [2025-03-08 07:32:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 470 transitions. [2025-03-08 07:32:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 470 transitions. [2025-03-08 07:32:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:00,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:00,710 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] [2025-03-08 07:32:00,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:32:00,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:00,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -672417408, now seen corresponding path program 1 times [2025-03-08 07:32:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371212565] [2025-03-08 07:32:00,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:00,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:00,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:00,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:00,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:00,832 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:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371212565] [2025-03-08 07:32:00,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371212565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:00,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:00,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158799576] [2025-03-08 07:32:00,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:00,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:00,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:00,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:00,834 INFO L87 Difference]: Start difference. First operand 301 states and 470 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:01,241 INFO L93 Difference]: Finished difference Result 903 states and 1426 transitions. [2025-03-08 07:32:01,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:01,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:01,244 INFO L225 Difference]: With dead ends: 903 [2025-03-08 07:32:01,245 INFO L226 Difference]: Without dead ends: 620 [2025-03-08 07:32:01,246 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:01,247 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 894 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:01,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1286 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-08 07:32:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 597. [2025-03-08 07:32:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 542 states have (on average 1.5774907749077491) internal successors, (855), 544 states have internal predecessors, (855), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 07:32:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 938 transitions. [2025-03-08 07:32:01,268 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 938 transitions. Word has length 143 [2025-03-08 07:32:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:01,268 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 938 transitions. [2025-03-08 07:32:01,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 938 transitions. [2025-03-08 07:32:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:01,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:01,270 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] [2025-03-08 07:32:01,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:32:01,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 88265154, now seen corresponding path program 1 times [2025-03-08 07:32:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:01,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793210218] [2025-03-08 07:32:01,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:01,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:01,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:01,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:01,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:01,379 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:01,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793210218] [2025-03-08 07:32:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793210218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:01,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:01,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973879770] [2025-03-08 07:32:01,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:01,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:01,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:01,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:01,380 INFO L87 Difference]: Start difference. First operand 597 states and 938 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:01,971 INFO L93 Difference]: Finished difference Result 1549 states and 2461 transitions. [2025-03-08 07:32:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:01,975 INFO L225 Difference]: With dead ends: 1549 [2025-03-08 07:32:01,975 INFO L226 Difference]: Without dead ends: 970 [2025-03-08 07:32:01,976 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:01,976 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 895 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:01,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2453 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-03-08 07:32:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 871. [2025-03-08 07:32:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 791 states have (on average 1.570164348925411) internal successors, (1242), 794 states have internal predecessors, (1242), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-03-08 07:32:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1364 transitions. [2025-03-08 07:32:02,005 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1364 transitions. Word has length 143 [2025-03-08 07:32:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1364 transitions. [2025-03-08 07:32:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1364 transitions. [2025-03-08 07:32:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:02,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:02,006 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] [2025-03-08 07:32:02,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:32:02,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:02,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1815194941, now seen corresponding path program 1 times [2025-03-08 07:32:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64668925] [2025-03-08 07:32:02,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:02,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:02,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:02,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:02,126 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:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:02,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64668925] [2025-03-08 07:32:02,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64668925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:02,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448255767] [2025-03-08 07:32:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:02,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:02,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:02,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:02,129 INFO L87 Difference]: Start difference. First operand 871 states and 1364 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:02,723 INFO L93 Difference]: Finished difference Result 2420 states and 3836 transitions. [2025-03-08 07:32:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:02,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:02,729 INFO L225 Difference]: With dead ends: 2420 [2025-03-08 07:32:02,729 INFO L226 Difference]: Without dead ends: 1567 [2025-03-08 07:32:02,731 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:02,732 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 890 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:02,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2437 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-08 07:32:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1454. [2025-03-08 07:32:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1322 states have (on average 1.5726172465960666) internal successors, (2079), 1329 states have internal predecessors, (2079), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-03-08 07:32:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2285 transitions. [2025-03-08 07:32:02,792 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2285 transitions. Word has length 143 [2025-03-08 07:32:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2285 transitions. [2025-03-08 07:32:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2285 transitions. [2025-03-08 07:32:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:02,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:02,794 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] [2025-03-08 07:32:02,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:32:02,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -214028894, now seen corresponding path program 1 times [2025-03-08 07:32:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035518928] [2025-03-08 07:32:02,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:02,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:02,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035518928] [2025-03-08 07:32:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035518928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848883320] [2025-03-08 07:32:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:02,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:02,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:02,904 INFO L87 Difference]: Start difference. First operand 1454 states and 2285 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:03,508 INFO L93 Difference]: Finished difference Result 4297 states and 6859 transitions. [2025-03-08 07:32:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:03,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:03,520 INFO L225 Difference]: With dead ends: 4297 [2025-03-08 07:32:03,520 INFO L226 Difference]: Without dead ends: 2861 [2025-03-08 07:32:03,524 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:03,525 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 885 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:03,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 2425 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2025-03-08 07:32:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2719. [2025-03-08 07:32:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2477 states have (on average 1.5870004037141703) internal successors, (3931), 2498 states have internal predecessors, (3931), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 07:32:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4329 transitions. [2025-03-08 07:32:03,625 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4329 transitions. Word has length 143 [2025-03-08 07:32:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:03,625 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 4329 transitions. [2025-03-08 07:32:03,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4329 transitions. [2025-03-08 07:32:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:03,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:03,627 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] [2025-03-08 07:32:03,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:32:03,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash -855115037, now seen corresponding path program 1 times [2025-03-08 07:32:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257498861] [2025-03-08 07:32:03,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:03,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:03,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:03,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:03,771 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:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257498861] [2025-03-08 07:32:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257498861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911718565] [2025-03-08 07:32:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:03,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:03,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:03,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:03,773 INFO L87 Difference]: Start difference. First operand 2719 states and 4329 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:04,164 INFO L93 Difference]: Finished difference Result 5884 states and 9554 transitions. [2025-03-08 07:32:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:04,178 INFO L225 Difference]: With dead ends: 5884 [2025-03-08 07:32:04,178 INFO L226 Difference]: Without dead ends: 3183 [2025-03-08 07:32:04,187 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:04,188 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 630 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:04,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 910 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2025-03-08 07:32:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2719. [2025-03-08 07:32:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2477 states have (on average 1.583366976180864) internal successors, (3922), 2498 states have internal predecessors, (3922), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 07:32:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4320 transitions. [2025-03-08 07:32:04,334 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4320 transitions. Word has length 143 [2025-03-08 07:32:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:04,334 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 4320 transitions. [2025-03-08 07:32:04,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4320 transitions. [2025-03-08 07:32:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:04,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:04,337 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] [2025-03-08 07:32:04,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:32:04,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:04,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash 371130754, now seen corresponding path program 1 times [2025-03-08 07:32:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390500887] [2025-03-08 07:32:04,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:04,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:04,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:04,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:04,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:04,429 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:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390500887] [2025-03-08 07:32:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390500887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022688563] [2025-03-08 07:32:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:04,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:04,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:04,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:04,431 INFO L87 Difference]: Start difference. First operand 2719 states and 4320 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:04,747 INFO L93 Difference]: Finished difference Result 5855 states and 9478 transitions. [2025-03-08 07:32:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:04,760 INFO L225 Difference]: With dead ends: 5855 [2025-03-08 07:32:04,760 INFO L226 Difference]: Without dead ends: 3154 [2025-03-08 07:32:04,767 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:04,768 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 627 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:04,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 902 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2025-03-08 07:32:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2719. [2025-03-08 07:32:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2477 states have (on average 1.5797335486475574) internal successors, (3913), 2498 states have internal predecessors, (3913), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 07:32:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4311 transitions. [2025-03-08 07:32:04,925 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4311 transitions. Word has length 143 [2025-03-08 07:32:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:04,926 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 4311 transitions. [2025-03-08 07:32:04,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4311 transitions. [2025-03-08 07:32:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:04,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:04,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:32:04,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:04,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1657613059, now seen corresponding path program 1 times [2025-03-08 07:32:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:04,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320765864] [2025-03-08 07:32:04,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:04,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:04,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,062 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:05,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320765864] [2025-03-08 07:32:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320765864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387076311] [2025-03-08 07:32:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:05,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:05,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:05,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:05,065 INFO L87 Difference]: Start difference. First operand 2719 states and 4311 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,504 INFO L93 Difference]: Finished difference Result 5826 states and 9402 transitions. [2025-03-08 07:32:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:05,518 INFO L225 Difference]: With dead ends: 5826 [2025-03-08 07:32:05,518 INFO L226 Difference]: Without dead ends: 3125 [2025-03-08 07:32:05,523 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:05,524 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 624 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:05,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 894 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:32:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-03-08 07:32:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2719. [2025-03-08 07:32:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2477 states have (on average 1.5761001211142511) internal successors, (3904), 2498 states have internal predecessors, (3904), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 07:32:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4302 transitions. [2025-03-08 07:32:05,672 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4302 transitions. Word has length 143 [2025-03-08 07:32:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:05,674 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 4302 transitions. [2025-03-08 07:32:05,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4302 transitions. [2025-03-08 07:32:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:05,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:05,678 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] [2025-03-08 07:32:05,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:32:05,678 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:05,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash -656192158, now seen corresponding path program 1 times [2025-03-08 07:32:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475421873] [2025-03-08 07:32:05,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:05,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:05,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:05,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:05,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,800 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:05,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475421873] [2025-03-08 07:32:05,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475421873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:05,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103024205] [2025-03-08 07:32:05,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:05,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:05,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:05,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:05,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:05,801 INFO L87 Difference]: Start difference. First operand 2719 states and 4302 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:06,581 INFO L93 Difference]: Finished difference Result 8314 states and 13392 transitions. [2025-03-08 07:32:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:06,608 INFO L225 Difference]: With dead ends: 8314 [2025-03-08 07:32:06,608 INFO L226 Difference]: Without dead ends: 5613 [2025-03-08 07:32:06,618 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:06,618 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 856 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:06,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 2356 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2025-03-08 07:32:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 5447. [2025-03-08 07:32:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5447 states, 4967 states have (on average 1.5949265149989933) internal successors, (7922), 5034 states have internal predecessors, (7922), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 07:32:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 5447 states and 8800 transitions. [2025-03-08 07:32:06,860 INFO L78 Accepts]: Start accepts. Automaton has 5447 states and 8800 transitions. Word has length 143 [2025-03-08 07:32:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 5447 states and 8800 transitions. [2025-03-08 07:32:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5447 states and 8800 transitions. [2025-03-08 07:32:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:06,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:06,864 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] [2025-03-08 07:32:06,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:32:06,865 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:06,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1839209693, now seen corresponding path program 1 times [2025-03-08 07:32:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447590512] [2025-03-08 07:32:06,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:06,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:06,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:06,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:06,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:06,967 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:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:06,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447590512] [2025-03-08 07:32:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447590512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:06,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:06,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085412861] [2025-03-08 07:32:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:06,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:06,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:06,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:06,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:06,969 INFO L87 Difference]: Start difference. First operand 5447 states and 8800 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,024 INFO L93 Difference]: Finished difference Result 18192 states and 29977 transitions. [2025-03-08 07:32:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,082 INFO L225 Difference]: With dead ends: 18192 [2025-03-08 07:32:08,083 INFO L226 Difference]: Without dead ends: 12763 [2025-03-08 07:32:08,099 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:08,099 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1132 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 2317 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12763 states. [2025-03-08 07:32:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12763 to 11395. [2025-03-08 07:32:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11395 states, 10401 states have (on average 1.618690510527834) internal successors, (16836), 10614 states have internal predecessors, (16836), 583 states have call successors, (583), 198 states have call predecessors, (583), 410 states have return successors, (1607), 614 states have call predecessors, (1607), 583 states have call successors, (1607) [2025-03-08 07:32:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11395 states to 11395 states and 19026 transitions. [2025-03-08 07:32:08,842 INFO L78 Accepts]: Start accepts. Automaton has 11395 states and 19026 transitions. Word has length 143 [2025-03-08 07:32:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,844 INFO L471 AbstractCegarLoop]: Abstraction has 11395 states and 19026 transitions. [2025-03-08 07:32:08,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11395 states and 19026 transitions. [2025-03-08 07:32:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:08,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,883 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] [2025-03-08 07:32:08,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:32:08,883 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1171846436, now seen corresponding path program 1 times [2025-03-08 07:32:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572531850] [2025-03-08 07:32:08,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,975 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,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572531850] [2025-03-08 07:32:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572531850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352695611] [2025-03-08 07:32:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:08,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:08,978 INFO L87 Difference]: Start difference. First operand 11395 states and 19026 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:10,298 INFO L93 Difference]: Finished difference Result 38548 states and 66345 transitions. [2025-03-08 07:32:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:10,408 INFO L225 Difference]: With dead ends: 38548 [2025-03-08 07:32:10,408 INFO L226 Difference]: Without dead ends: 27171 [2025-03-08 07:32:10,443 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:10,444 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1096 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:10,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 2301 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27171 states. [2025-03-08 07:32:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27171 to 24654. [2025-03-08 07:32:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24654 states, 22486 states have (on average 1.6447567375255714) internal successors, (36984), 23153 states have internal predecessors, (36984), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 1056 states have return successors, (5207), 1174 states have call predecessors, (5207), 1111 states have call successors, (5207) [2025-03-08 07:32:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24654 states to 24654 states and 43302 transitions. [2025-03-08 07:32:11,866 INFO L78 Accepts]: Start accepts. Automaton has 24654 states and 43302 transitions. Word has length 143 [2025-03-08 07:32:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:11,866 INFO L471 AbstractCegarLoop]: Abstraction has 24654 states and 43302 transitions. [2025-03-08 07:32:11,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 24654 states and 43302 transitions. [2025-03-08 07:32:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:11,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:11,877 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] [2025-03-08 07:32:11,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:32:11,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1407524611, now seen corresponding path program 1 times [2025-03-08 07:32:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081285630] [2025-03-08 07:32:11,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:11,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:11,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,970 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:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081285630] [2025-03-08 07:32:11,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081285630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204067977] [2025-03-08 07:32:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:11,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:11,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:11,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:11,972 INFO L87 Difference]: Start difference. First operand 24654 states and 43302 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:15,066 INFO L93 Difference]: Finished difference Result 84245 states and 154947 transitions. [2025-03-08 07:32:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:15,399 INFO L225 Difference]: With dead ends: 84245 [2025-03-08 07:32:15,399 INFO L226 Difference]: Without dead ends: 59609 [2025-03-08 07:32:15,490 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:15,492 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 1062 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:15,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 2293 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59609 states. [2025-03-08 07:32:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59609 to 55335. [2025-03-08 07:32:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55335 states, 50365 states have (on average 1.6720341506998908) internal successors, (84212), 52426 states have internal predecessors, (84212), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 2834 states have return successors, (18519), 2262 states have call predecessors, (18519), 2135 states have call successors, (18519) [2025-03-08 07:32:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55335 states to 55335 states and 104866 transitions. [2025-03-08 07:32:18,482 INFO L78 Accepts]: Start accepts. Automaton has 55335 states and 104866 transitions. Word has length 143 [2025-03-08 07:32:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:18,483 INFO L471 AbstractCegarLoop]: Abstraction has 55335 states and 104866 transitions. [2025-03-08 07:32:18,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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,483 INFO L276 IsEmpty]: Start isEmpty. Operand 55335 states and 104866 transitions. [2025-03-08 07:32:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:18,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:18,512 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] [2025-03-08 07:32:18,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:32:18,512 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash 583843140, now seen corresponding path program 1 times [2025-03-08 07:32:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640548991] [2025-03-08 07:32:18,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:18,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:18,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:18,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:18,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:18,638 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,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640548991] [2025-03-08 07:32:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640548991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:18,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:18,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693754227] [2025-03-08 07:32:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:18,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:18,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:18,641 INFO L87 Difference]: Start difference. First operand 55335 states and 104866 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:25,169 INFO L93 Difference]: Finished difference Result 190228 states and 386505 transitions. [2025-03-08 07:32:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:25,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-03-08 07:32:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:25,956 INFO L225 Difference]: With dead ends: 190228 [2025-03-08 07:32:25,956 INFO L226 Difference]: Without dead ends: 134911 [2025-03-08 07:32:26,194 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:26,196 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1027 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:26,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2281 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134911 states. [2025-03-08 07:32:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134911 to 127440. [2025-03-08 07:32:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127440 states, 115472 states have (on average 1.6971387002909797) internal successors, (195972), 121779 states have internal predecessors, (195972), 4119 states have call successors, (4119), 1542 states have call predecessors, (4119), 7848 states have return successors, (69655), 4374 states have call predecessors, (69655), 4119 states have call successors, (69655) [2025-03-08 07:32:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127440 states to 127440 states and 269746 transitions. [2025-03-08 07:32:36,425 INFO L78 Accepts]: Start accepts. Automaton has 127440 states and 269746 transitions. Word has length 143 [2025-03-08 07:32:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:36,426 INFO L471 AbstractCegarLoop]: Abstraction has 127440 states and 269746 transitions. [2025-03-08 07:32:36,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 127440 states and 269746 transitions. [2025-03-08 07:32:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 07:32:36,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:36,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:32:36,457 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1665651427, now seen corresponding path program 1 times [2025-03-08 07:32:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850385312] [2025-03-08 07:32:36,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:36,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 07:32:36,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 07:32:36,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:36,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:36,544 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:36,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:36,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850385312] [2025-03-08 07:32:36,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850385312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:36,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544309504] [2025-03-08 07:32:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:36,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:36,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:36,546 INFO L87 Difference]: Start difference. First operand 127440 states and 269746 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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)