./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:19:41,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:19:41,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:19:41,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:19:41,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:19:41,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:19:41,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:19:41,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:19:41,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:19:41,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:19:41,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:19:41,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:19:41,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:19:41,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:19:41,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:19:41,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:19:41,558 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 -> a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb [2025-03-03 16:19:41,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:19:41,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:19:41,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:19:41,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:19:41,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:19:41,782 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.02.cil-2.c [2025-03-03 16:19:42,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e492b1f/555044cbbf554a0aa69448351b8ac7af/FLAG6d0574da1 [2025-03-03 16:19:43,135 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:19:43,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2025-03-03 16:19:43,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e492b1f/555044cbbf554a0aa69448351b8ac7af/FLAG6d0574da1 [2025-03-03 16:19:43,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e492b1f/555044cbbf554a0aa69448351b8ac7af [2025-03-03 16:19:43,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:19:43,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:19:43,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:19:43,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:19:43,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:19:43,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efe975a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43, skipping insertion in model container [2025-03-03 16:19:43,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:19:43,611 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.02.cil-2.c[913,926] [2025-03-03 16:19:43,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2025-03-03 16:19:43,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:19:43,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:19:43,698 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.02.cil-2.c[913,926] [2025-03-03 16:19:43,717 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.02.cil-2.c[5977,5990] [2025-03-03 16:19:43,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:19:43,760 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:19:43,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43 WrapperNode [2025-03-03 16:19:43,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:19:43,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:19:43,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:19:43,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:19:43,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,799 INFO L138 Inliner]: procedures = 52, calls = 55, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 462 [2025-03-03 16:19:43,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:19:43,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:19:43,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:19:43,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:19:43,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,822 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-03 16:19:43,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:19:43,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:19:43,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:19:43,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:19:43,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:19:43,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:43,857 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-03 16:19:43,859 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-03 16:19:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:19:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:19:43,876 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:19:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-03 16:19:43,876 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:19:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:19:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:19:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:19:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:19:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:19:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:19:43,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:19:43,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:19:43,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:19:43,878 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:19:43,878 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:19:43,878 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:19:43,878 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:19:43,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:19:43,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:19:44,324 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-03 16:19:44,325 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:19:44,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:19:44,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:19:44,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:19:44 BoogieIcfgContainer [2025-03-03 16:19:44,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:19:44,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:19:44,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:19:44,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:19:44,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:19:43" (1/3) ... [2025-03-03 16:19:44,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a000b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:19:44, skipping insertion in model container [2025-03-03 16:19:44,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (2/3) ... [2025-03-03 16:19:44,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a000b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:19:44, skipping insertion in model container [2025-03-03 16:19:44,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:19:44" (3/3) ... [2025-03-03 16:19:44,342 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2025-03-03 16:19:44,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:19:44,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c that has 11 procedures, 220 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 16:19:44,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:19:44,412 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;@47e3785c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:19:44,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:19:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 183 states have (on average 1.5027322404371584) internal successors, (275), 190 states have internal predecessors, (275), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 16:19:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:19:44,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,421 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] [2025-03-03 16:19:44,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 473482520, now seen corresponding path program 1 times [2025-03-03 16:19:44,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689115654] [2025-03-03 16:19:44,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:19:44,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:19:44,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,583 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-03 16:19:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689115654] [2025-03-03 16:19:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689115654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473779657] [2025-03-03 16:19:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,603 INFO L87 Difference]: Start difference. First operand has 220 states, 183 states have (on average 1.5027322404371584) internal successors, (275), 190 states have internal predecessors, (275), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 16:19:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:44,645 INFO L93 Difference]: Finished difference Result 423 states and 620 transitions. [2025-03-03 16:19:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-03 16:19:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:44,652 INFO L225 Difference]: With dead ends: 423 [2025-03-03 16:19:44,652 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 16:19:44,655 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-03 16:19:44,656 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 95 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 512 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-03 16:19:44,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 512 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 16:19:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-03 16:19:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.4457142857142857) internal successors, (253), 179 states have internal predecessors, (253), 24 states have call successors, (24), 10 states have call predecessors, (24), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 16:19:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 297 transitions. [2025-03-03 16:19:44,696 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 297 transitions. Word has length 44 [2025-03-03 16:19:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 297 transitions. [2025-03-03 16:19:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 16:19:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 297 transitions. [2025-03-03 16:19:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:19:44,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:44,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:19:44,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1396166103, now seen corresponding path program 1 times [2025-03-03 16:19:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368526219] [2025-03-03 16:19:44,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:19:44,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:19:44,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,783 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-03 16:19:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368526219] [2025-03-03 16:19:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368526219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326493080] [2025-03-03 16:19:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,787 INFO L87 Difference]: Start difference. First operand 209 states and 297 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:19:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:44,845 INFO L93 Difference]: Finished difference Result 333 states and 469 transitions. [2025-03-03 16:19:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:44,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2025-03-03 16:19:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:44,850 INFO L225 Difference]: With dead ends: 333 [2025-03-03 16:19:44,850 INFO L226 Difference]: Without dead ends: 269 [2025-03-03 16:19:44,851 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-03 16:19:44,853 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 275 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 393 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-03 16:19:44,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-03 16:19:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2025-03-03 16:19:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 229 states have internal predecessors, (319), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-03 16:19:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 375 transitions. [2025-03-03 16:19:44,880 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 375 transitions. Word has length 44 [2025-03-03 16:19:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:44,880 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 375 transitions. [2025-03-03 16:19:44,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:19:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 375 transitions. [2025-03-03 16:19:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 16:19:44,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,882 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] [2025-03-03 16:19:44,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:19:44,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1913320476, now seen corresponding path program 1 times [2025-03-03 16:19:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431419388] [2025-03-03 16:19:44,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 16:19:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 16:19:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,947 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-03 16:19:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431419388] [2025-03-03 16:19:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431419388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026354073] [2025-03-03 16:19:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,949 INFO L87 Difference]: Start difference. First operand 265 states and 375 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 16:19:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:45,005 INFO L93 Difference]: Finished difference Result 493 states and 695 transitions. [2025-03-03 16:19:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:45,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2025-03-03 16:19:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:45,008 INFO L225 Difference]: With dead ends: 493 [2025-03-03 16:19:45,010 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 16:19:45,011 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-03 16:19:45,011 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 272 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 375 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-03 16:19:45,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 375 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 16:19:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-03-03 16:19:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 319 states have (on average 1.3887147335423198) internal successors, (443), 323 states have internal predecessors, (443), 36 states have call successors, (36), 16 states have call predecessors, (36), 14 states have return successors, (40), 32 states have call predecessors, (40), 32 states have call successors, (40) [2025-03-03 16:19:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 519 transitions. [2025-03-03 16:19:45,036 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 519 transitions. Word has length 45 [2025-03-03 16:19:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:45,036 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 519 transitions. [2025-03-03 16:19:45,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 16:19:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 519 transitions. [2025-03-03 16:19:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:19:45,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:45,038 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] [2025-03-03 16:19:45,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:19:45,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:45,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:45,038 INFO L85 PathProgramCache]: Analyzing trace with hash 858316401, now seen corresponding path program 1 times [2025-03-03 16:19:45,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:45,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827937939] [2025-03-03 16:19:45,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:45,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:45,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:19:45,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:19:45,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:45,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:45,096 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-03 16:19:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827937939] [2025-03-03 16:19:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827937939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917647299] [2025-03-03 16:19:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:45,097 INFO L87 Difference]: Start difference. First operand 371 states and 519 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-03 16:19:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:45,139 INFO L93 Difference]: Finished difference Result 779 states and 1072 transitions. [2025-03-03 16:19:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:45,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 46 [2025-03-03 16:19:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:45,143 INFO L225 Difference]: With dead ends: 779 [2025-03-03 16:19:45,144 INFO L226 Difference]: Without dead ends: 555 [2025-03-03 16:19:45,144 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-03 16:19:45,147 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 67 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 596 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-03 16:19:45,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 596 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-03 16:19:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 496. [2025-03-03 16:19:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 432 states have (on average 1.3703703703703705) internal successors, (592), 438 states have internal predecessors, (592), 42 states have call successors, (42), 22 states have call predecessors, (42), 20 states have return successors, (48), 36 states have call predecessors, (48), 38 states have call successors, (48) [2025-03-03 16:19:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 682 transitions. [2025-03-03 16:19:45,182 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 682 transitions. Word has length 46 [2025-03-03 16:19:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 682 transitions. [2025-03-03 16:19:45,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-03 16:19:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 682 transitions. [2025-03-03 16:19:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:19:45,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:45,187 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-03 16:19:45,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:19:45,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:45,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash -739843, now seen corresponding path program 1 times [2025-03-03 16:19:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982277010] [2025-03-03 16:19:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:45,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:19:45,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:19:45,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:45,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:19:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982277010] [2025-03-03 16:19:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982277010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697172581] [2025-03-03 16:19:45,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:45,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:45,264 INFO L87 Difference]: Start difference. First operand 496 states and 682 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03 16:19:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:45,305 INFO L93 Difference]: Finished difference Result 785 states and 1073 transitions. [2025-03-03 16:19:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:45,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 63 [2025-03-03 16:19:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:45,310 INFO L225 Difference]: With dead ends: 785 [2025-03-03 16:19:45,312 INFO L226 Difference]: Without dead ends: 557 [2025-03-03 16:19:45,313 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-03 16:19:45,314 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 55 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:45,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 643 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-03 16:19:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-03-03 16:19:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 485 states have (on average 1.3443298969072166) internal successors, (652), 491 states have internal predecessors, (652), 47 states have call successors, (47), 25 states have call predecessors, (47), 23 states have return successors, (56), 41 states have call predecessors, (56), 43 states have call successors, (56) [2025-03-03 16:19:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 755 transitions. [2025-03-03 16:19:45,347 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 755 transitions. Word has length 63 [2025-03-03 16:19:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:45,348 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 755 transitions. [2025-03-03 16:19:45,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03 16:19:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 755 transitions. [2025-03-03 16:19:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:45,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:45,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:19:45,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1144105710, now seen corresponding path program 1 times [2025-03-03 16:19:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516220073] [2025-03-03 16:19:45,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:45,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:45,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:45,456 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-03 16:19:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:45,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516220073] [2025-03-03 16:19:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516220073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:45,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:19:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614370023] [2025-03-03 16:19:45,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:19:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:19:45,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:19:45,459 INFO L87 Difference]: Start difference. First operand 557 states and 755 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:45,810 INFO L93 Difference]: Finished difference Result 825 states and 1149 transitions. [2025-03-03 16:19:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:19:45,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:45,813 INFO L225 Difference]: With dead ends: 825 [2025-03-03 16:19:45,815 INFO L226 Difference]: Without dead ends: 695 [2025-03-03 16:19:45,816 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-03 16:19:45,816 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 440 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:45,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 717 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-03 16:19:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 684. [2025-03-03 16:19:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 594 states have (on average 1.3703703703703705) internal successors, (814), 601 states have internal predecessors, (814), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (68), 52 states have call predecessors, (68), 54 states have call successors, (68) [2025-03-03 16:19:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 940 transitions. [2025-03-03 16:19:45,855 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 940 transitions. Word has length 69 [2025-03-03 16:19:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 940 transitions. [2025-03-03 16:19:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 940 transitions. [2025-03-03 16:19:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:45,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:45,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:45,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:19:45,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:45,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1195462892, now seen corresponding path program 1 times [2025-03-03 16:19:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:45,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184877103] [2025-03-03 16:19:45,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:45,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:45,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:45,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:45,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:45,956 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-03 16:19:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184877103] [2025-03-03 16:19:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184877103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862124739] [2025-03-03 16:19:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:45,958 INFO L87 Difference]: Start difference. First operand 684 states and 940 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:46,419 INFO L93 Difference]: Finished difference Result 1096 states and 1544 transitions. [2025-03-03 16:19:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:46,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:46,423 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 16:19:46,423 INFO L226 Difference]: Without dead ends: 839 [2025-03-03 16:19:46,424 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-03 16:19:46,424 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 429 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:46,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1249 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:19:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-03 16:19:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 804. [2025-03-03 16:19:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 696 states have (on average 1.382183908045977) internal successors, (962), 704 states have internal predecessors, (962), 69 states have call successors, (69), 37 states have call predecessors, (69), 37 states have return successors, (82), 64 states have call predecessors, (82), 65 states have call successors, (82) [2025-03-03 16:19:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1113 transitions. [2025-03-03 16:19:46,459 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1113 transitions. Word has length 69 [2025-03-03 16:19:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:46,459 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1113 transitions. [2025-03-03 16:19:46,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1113 transitions. [2025-03-03 16:19:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:46,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:46,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:19:46,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:46,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1888855597, now seen corresponding path program 1 times [2025-03-03 16:19:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385687351] [2025-03-03 16:19:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:46,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:46,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:46,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:46,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:46,528 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-03 16:19:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385687351] [2025-03-03 16:19:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385687351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025050438] [2025-03-03 16:19:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:46,530 INFO L87 Difference]: Start difference. First operand 804 states and 1113 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:46,943 INFO L93 Difference]: Finished difference Result 1466 states and 2082 transitions. [2025-03-03 16:19:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:46,949 INFO L225 Difference]: With dead ends: 1466 [2025-03-03 16:19:46,949 INFO L226 Difference]: Without dead ends: 1089 [2025-03-03 16:19:46,950 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-03 16:19:46,950 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 424 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:46,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1233 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-03 16:19:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1053. [2025-03-03 16:19:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 907 states have (on average 1.3991179713340685) internal successors, (1269), 919 states have internal predecessors, (1269), 91 states have call successors, (91), 49 states have call predecessors, (91), 53 states have return successors, (116), 88 states have call predecessors, (116), 87 states have call successors, (116) [2025-03-03 16:19:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1476 transitions. [2025-03-03 16:19:46,997 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1476 transitions. Word has length 69 [2025-03-03 16:19:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1476 transitions. [2025-03-03 16:19:46,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1476 transitions. [2025-03-03 16:19:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:46,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:46,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:46,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:19:46,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:47,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1968102196, now seen corresponding path program 1 times [2025-03-03 16:19:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:47,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014556872] [2025-03-03 16:19:47,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:47,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:47,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:47,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:47,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:47,065 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-03 16:19:47,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:47,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014556872] [2025-03-03 16:19:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014556872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159526752] [2025-03-03 16:19:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:47,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:47,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:47,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:47,066 INFO L87 Difference]: Start difference. First operand 1053 states and 1476 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:47,487 INFO L93 Difference]: Finished difference Result 2313 states and 3332 transitions. [2025-03-03 16:19:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:47,494 INFO L225 Difference]: With dead ends: 2313 [2025-03-03 16:19:47,494 INFO L226 Difference]: Without dead ends: 1687 [2025-03-03 16:19:47,496 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-03 16:19:47,497 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 493 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:47,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1208 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2025-03-03 16:19:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1560. [2025-03-03 16:19:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1336 states have (on average 1.4199101796407185) internal successors, (1897), 1362 states have internal predecessors, (1897), 131 states have call successors, (131), 73 states have call predecessors, (131), 91 states have return successors, (204), 132 states have call predecessors, (204), 127 states have call successors, (204) [2025-03-03 16:19:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2232 transitions. [2025-03-03 16:19:47,559 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2232 transitions. Word has length 69 [2025-03-03 16:19:47,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:47,559 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2232 transitions. [2025-03-03 16:19:47,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2232 transitions. [2025-03-03 16:19:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:47,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:47,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:47,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:19:47,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:47,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash 401331789, now seen corresponding path program 1 times [2025-03-03 16:19:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:47,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276447334] [2025-03-03 16:19:47,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:47,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:47,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:47,645 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-03 16:19:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276447334] [2025-03-03 16:19:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276447334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:47,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:47,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885070624] [2025-03-03 16:19:47,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:47,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:47,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:47,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:47,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:47,646 INFO L87 Difference]: Start difference. First operand 1560 states and 2232 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:48,112 INFO L93 Difference]: Finished difference Result 3896 states and 5754 transitions. [2025-03-03 16:19:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:48,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:48,125 INFO L225 Difference]: With dead ends: 3896 [2025-03-03 16:19:48,125 INFO L226 Difference]: Without dead ends: 2763 [2025-03-03 16:19:48,129 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-03 16:19:48,130 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 457 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:48,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1192 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-03 16:19:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2519. [2025-03-03 16:19:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2125 states have (on average 1.423529411764706) internal successors, (3025), 2197 states have internal predecessors, (3025), 207 states have call successors, (207), 121 states have call predecessors, (207), 185 states have return successors, (472), 216 states have call predecessors, (472), 203 states have call successors, (472) [2025-03-03 16:19:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3704 transitions. [2025-03-03 16:19:48,255 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3704 transitions. Word has length 69 [2025-03-03 16:19:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:48,255 INFO L471 AbstractCegarLoop]: Abstraction has 2519 states and 3704 transitions. [2025-03-03 16:19:48,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3704 transitions. [2025-03-03 16:19:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:48,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:48,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:19:48,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1170501804, now seen corresponding path program 1 times [2025-03-03 16:19:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746552355] [2025-03-03 16:19:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:48,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:48,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:48,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:48,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:48,341 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-03 16:19:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746552355] [2025-03-03 16:19:48,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746552355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:48,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:48,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345736083] [2025-03-03 16:19:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:48,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:48,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:48,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:48,342 INFO L87 Difference]: Start difference. First operand 2519 states and 3704 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:48,836 INFO L93 Difference]: Finished difference Result 6831 states and 10508 transitions. [2025-03-03 16:19:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:48,857 INFO L225 Difference]: With dead ends: 6831 [2025-03-03 16:19:48,857 INFO L226 Difference]: Without dead ends: 4739 [2025-03-03 16:19:48,863 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-03 16:19:48,863 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 423 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:48,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1184 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2025-03-03 16:19:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4570. [2025-03-03 16:19:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 3798 states have (on average 1.4231174302264349) internal successors, (5405), 4016 states have internal predecessors, (5405), 347 states have call successors, (347), 213 states have call predecessors, (347), 423 states have return successors, (1380), 372 states have call predecessors, (1380), 343 states have call successors, (1380) [2025-03-03 16:19:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 7132 transitions. [2025-03-03 16:19:49,133 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 7132 transitions. Word has length 69 [2025-03-03 16:19:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:49,133 INFO L471 AbstractCegarLoop]: Abstraction has 4570 states and 7132 transitions. [2025-03-03 16:19:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 7132 transitions. [2025-03-03 16:19:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:19:49,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:49,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:49,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:19:49,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:49,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1991274899, now seen corresponding path program 1 times [2025-03-03 16:19:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:49,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543806532] [2025-03-03 16:19:49,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:49,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:19:49,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:19:49,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:49,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:49,188 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-03 16:19:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543806532] [2025-03-03 16:19:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543806532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:19:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021072822] [2025-03-03 16:19:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:19:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:49,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:19:49,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:19:49,189 INFO L87 Difference]: Start difference. First operand 4570 states and 7132 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:49,496 INFO L93 Difference]: Finished difference Result 10889 states and 17200 transitions. [2025-03-03 16:19:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:19:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-03 16:19:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:49,525 INFO L225 Difference]: With dead ends: 10889 [2025-03-03 16:19:49,525 INFO L226 Difference]: Without dead ends: 6747 [2025-03-03 16:19:49,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:19:49,536 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 424 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:49,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 829 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2025-03-03 16:19:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 6514. [2025-03-03 16:19:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6514 states, 5402 states have (on average 1.4026286560533137) internal successors, (7577), 5703 states have internal predecessors, (7577), 519 states have call successors, (519), 315 states have call predecessors, (519), 591 states have return successors, (1793), 527 states have call predecessors, (1793), 515 states have call successors, (1793) [2025-03-03 16:19:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 9889 transitions. [2025-03-03 16:19:49,925 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 9889 transitions. Word has length 69 [2025-03-03 16:19:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:49,926 INFO L471 AbstractCegarLoop]: Abstraction has 6514 states and 9889 transitions. [2025-03-03 16:19:49,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 9889 transitions. [2025-03-03 16:19:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:49,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:49,931 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, 1, 1, 1, 1, 1] [2025-03-03 16:19:49,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:19:49,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:49,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1532468361, now seen corresponding path program 1 times [2025-03-03 16:19:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395752882] [2025-03-03 16:19:49,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:49,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:49,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:49,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:49,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 16:19:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:49,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395752882] [2025-03-03 16:19:49,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395752882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:49,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:49,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516943554] [2025-03-03 16:19:49,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:49,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:49,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:49,963 INFO L87 Difference]: Start difference. First operand 6514 states and 9889 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 16:19:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:50,258 INFO L93 Difference]: Finished difference Result 6988 states and 10511 transitions. [2025-03-03 16:19:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-03-03 16:19:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:50,287 INFO L225 Difference]: With dead ends: 6988 [2025-03-03 16:19:50,288 INFO L226 Difference]: Without dead ends: 6627 [2025-03-03 16:19:50,292 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-03 16:19:50,293 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 258 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 381 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-03 16:19:50,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2025-03-03 16:19:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 6627. [2025-03-03 16:19:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 5503 states have (on average 1.398509903688897) internal successors, (7696), 5804 states have internal predecessors, (7696), 526 states have call successors, (526), 320 states have call predecessors, (526), 596 states have return successors, (1803), 534 states have call predecessors, (1803), 522 states have call successors, (1803) [2025-03-03 16:19:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 10025 transitions. [2025-03-03 16:19:50,633 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 10025 transitions. Word has length 68 [2025-03-03 16:19:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:50,634 INFO L471 AbstractCegarLoop]: Abstraction has 6627 states and 10025 transitions. [2025-03-03 16:19:50,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 16:19:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 10025 transitions. [2025-03-03 16:19:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:19:50,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:50,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:19:50,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1567296489, now seen corresponding path program 1 times [2025-03-03 16:19:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709296388] [2025-03-03 16:19:50,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:19:50,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:19:50,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:19:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709296388] [2025-03-03 16:19:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709296388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409534532] [2025-03-03 16:19:50,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:50,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:50,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:50,693 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-03 16:19:50,696 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-03 16:19:50,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:19:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:19:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 16:19:50,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:50,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:19:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:19:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409534532] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:50,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:19:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-03 16:19:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018666070] [2025-03-03 16:19:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:50,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:19:50,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:50,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:19:50,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:19:50,887 INFO L87 Difference]: Start difference. First operand 6627 states and 10025 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03 16:19:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:51,185 INFO L93 Difference]: Finished difference Result 6684 states and 10094 transitions. [2025-03-03 16:19:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:19:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 70 [2025-03-03 16:19:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:51,210 INFO L225 Difference]: With dead ends: 6684 [2025-03-03 16:19:51,210 INFO L226 Difference]: Without dead ends: 6681 [2025-03-03 16:19:51,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 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-03 16:19:51,214 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 511 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:51,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 389 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6681 states. [2025-03-03 16:19:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6681 to 6626. [2025-03-03 16:19:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 5503 states have (on average 1.3981464655642377) internal successors, (7694), 5803 states have internal predecessors, (7694), 525 states have call successors, (525), 320 states have call predecessors, (525), 596 states have return successors, (1803), 534 states have call predecessors, (1803), 522 states have call successors, (1803) [2025-03-03 16:19:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 10022 transitions. [2025-03-03 16:19:51,707 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 10022 transitions. Word has length 70 [2025-03-03 16:19:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 6626 states and 10022 transitions. [2025-03-03 16:19:51,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03 16:19:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 10022 transitions. [2025-03-03 16:19:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:19:51,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:51,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:19:51,720 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-03 16:19:51,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 16:19:51,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1341266932, now seen corresponding path program 1 times [2025-03-03 16:19:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475043214] [2025-03-03 16:19:51,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:19:51,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:19:51,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:51,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:19:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475043214] [2025-03-03 16:19:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475043214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115880583] [2025-03-03 16:19:51,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:51,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:51,973 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-03 16:19:51,975 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-03 16:19:52,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:19:52,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:19:52,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:52,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:52,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:19:52,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:52,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:19:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:19:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115880583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:19:52,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:19:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-03 16:19:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954285099] [2025-03-03 16:19:52,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:19:52,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:19:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:52,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:19:52,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:19:52,369 INFO L87 Difference]: Start difference. First operand 6626 states and 10022 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03 16:19:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:53,087 INFO L93 Difference]: Finished difference Result 7854 states and 11642 transitions. [2025-03-03 16:19:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 16:19:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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 71 [2025-03-03 16:19:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:53,113 INFO L225 Difference]: With dead ends: 7854 [2025-03-03 16:19:53,114 INFO L226 Difference]: Without dead ends: 7433 [2025-03-03 16:19:53,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 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-03 16:19:53,120 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 433 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:53,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2722 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:19:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2025-03-03 16:19:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 6974. [2025-03-03 16:19:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6974 states, 5817 states have (on average 1.3897197868317002) internal successors, (8084), 6121 states have internal predecessors, (8084), 544 states have call successors, (544), 333 states have call predecessors, (544), 611 states have return successors, (1832), 551 states have call predecessors, (1832), 541 states have call successors, (1832) [2025-03-03 16:19:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 10460 transitions. [2025-03-03 16:19:53,444 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 10460 transitions. Word has length 71 [2025-03-03 16:19:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:53,444 INFO L471 AbstractCegarLoop]: Abstraction has 6974 states and 10460 transitions. [2025-03-03 16:19:53,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03 16:19:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 10460 transitions. [2025-03-03 16:19:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:19:53,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:53,452 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2025-03-03 16:19:53,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:19:53,652 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,SelfDestructingSolverStorable14 [2025-03-03 16:19:53,653 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1036046966, now seen corresponding path program 1 times [2025-03-03 16:19:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036588444] [2025-03-03 16:19:53,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:53,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:19:53,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:19:53,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:53,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 16:19:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036588444] [2025-03-03 16:19:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036588444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075459913] [2025-03-03 16:19:53,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:53,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:53,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:53,700 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-03 16:19:53,708 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-03 16:19:53,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:19:53,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:19:53,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:53,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:53,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:19:53,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:19:53,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075459913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:53,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:19:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855470569] [2025-03-03 16:19:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:53,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:53,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:53,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:53,834 INFO L87 Difference]: Start difference. First operand 6974 states and 10460 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-03 16:19:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:54,056 INFO L93 Difference]: Finished difference Result 7567 states and 11228 transitions. [2025-03-03 16:19:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:54,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 90 [2025-03-03 16:19:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:54,086 INFO L225 Difference]: With dead ends: 7567 [2025-03-03 16:19:54,087 INFO L226 Difference]: Without dead ends: 6870 [2025-03-03 16:19:54,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-03 16:19:54,093 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 257 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 404 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-03 16:19:54,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 404 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6870 states. [2025-03-03 16:19:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6870 to 6853. [2025-03-03 16:19:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 5708 states have (on average 1.3912053258584443) internal successors, (7941), 6013 states have internal predecessors, (7941), 537 states have call successors, (537), 328 states have call predecessors, (537), 606 states have return successors, (1822), 543 states have call predecessors, (1822), 534 states have call successors, (1822) [2025-03-03 16:19:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 10300 transitions. [2025-03-03 16:19:54,439 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 10300 transitions. Word has length 90 [2025-03-03 16:19:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:54,439 INFO L471 AbstractCegarLoop]: Abstraction has 6853 states and 10300 transitions. [2025-03-03 16:19:54,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-03 16:19:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 10300 transitions. [2025-03-03 16:19:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:19:54,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:54,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:19:54,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:19:54,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:54,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 806898342, now seen corresponding path program 1 times [2025-03-03 16:19:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173499188] [2025-03-03 16:19:54,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:54,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:19:54,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:19:54,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:54,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:19:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173499188] [2025-03-03 16:19:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173499188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490701021] [2025-03-03 16:19:54,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:54,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:54,708 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-03 16:19:54,711 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-03 16:19:54,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:19:54,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:19:54,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:54,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:54,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:54,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:19:54,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:54,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490701021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:54,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:54,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:19:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322280104] [2025-03-03 16:19:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:54,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:54,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:54,795 INFO L87 Difference]: Start difference. First operand 6853 states and 10300 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (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-03 16:19:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:55,007 INFO L93 Difference]: Finished difference Result 7171 states and 10694 transitions. [2025-03-03 16:19:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (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 105 [2025-03-03 16:19:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:55,057 INFO L225 Difference]: With dead ends: 7171 [2025-03-03 16:19:55,057 INFO L226 Difference]: Without dead ends: 6098 [2025-03-03 16:19:55,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 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-03 16:19:55,063 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 62 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 612 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-03 16:19:55,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 612 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2025-03-03 16:19:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 6098. [2025-03-03 16:19:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6098 states, 5033 states have (on average 1.409696006358037) internal successors, (7095), 5330 states have internal predecessors, (7095), 490 states have call successors, (490), 297 states have call predecessors, (490), 574 states have return successors, (1753), 502 states have call predecessors, (1753), 488 states have call successors, (1753) [2025-03-03 16:19:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 9338 transitions. [2025-03-03 16:19:55,606 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 9338 transitions. Word has length 105 [2025-03-03 16:19:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:55,606 INFO L471 AbstractCegarLoop]: Abstraction has 6098 states and 9338 transitions. [2025-03-03 16:19:55,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (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-03 16:19:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 9338 transitions. [2025-03-03 16:19:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:19:55,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:55,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:19:55,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:19:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 16:19:55,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1828676975, now seen corresponding path program 1 times [2025-03-03 16:19:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:55,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034571290] [2025-03-03 16:19:55,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:55,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:55,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:19:55,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:19:55,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:55,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:19:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034571290] [2025-03-03 16:19:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034571290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34609727] [2025-03-03 16:19:55,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:55,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:55,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:55,893 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-03 16:19:55,895 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-03 16:19:55,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:19:55,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:19:55,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:55,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:55,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:55,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 16:19:56,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:56,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34609727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:56,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:19:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107207694] [2025-03-03 16:19:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:56,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:56,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:56,025 INFO L87 Difference]: Start difference. First operand 6098 states and 9338 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:56,477 INFO L93 Difference]: Finished difference Result 18079 states and 27834 transitions. [2025-03-03 16:19:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 113 [2025-03-03 16:19:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:56,514 INFO L225 Difference]: With dead ends: 18079 [2025-03-03 16:19:56,514 INFO L226 Difference]: Without dead ends: 11993 [2025-03-03 16:19:56,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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-03 16:19:56,529 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 158 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:56,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 375 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2025-03-03 16:19:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 11839. [2025-03-03 16:19:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11839 states, 9750 states have (on average 1.4072820512820512) internal successors, (13721), 10342 states have internal predecessors, (13721), 944 states have call successors, (944), 589 states have call predecessors, (944), 1144 states have return successors, (3441), 939 states have call predecessors, (3441), 942 states have call successors, (3441) [2025-03-03 16:19:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11839 states to 11839 states and 18106 transitions. [2025-03-03 16:19:57,117 INFO L78 Accepts]: Start accepts. Automaton has 11839 states and 18106 transitions. Word has length 113 [2025-03-03 16:19:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:57,117 INFO L471 AbstractCegarLoop]: Abstraction has 11839 states and 18106 transitions. [2025-03-03 16:19:57,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 11839 states and 18106 transitions. [2025-03-03 16:19:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:19:57,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:57,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:19:57,143 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-03 16:19:57,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:19:57,337 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:57,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 846240937, now seen corresponding path program 1 times [2025-03-03 16:19:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491676964] [2025-03-03 16:19:57,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:57,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:19:57,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:19:57,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:57,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:19:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491676964] [2025-03-03 16:19:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491676964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293562036] [2025-03-03 16:19:57,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:57,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:57,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:19:57,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:19:57,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:19:57,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:19:57,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:57,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:57,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:57,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 16:19:57,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293562036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:57,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:19:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943231915] [2025-03-03 16:19:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:57,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:57,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:57,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:57,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:57,508 INFO L87 Difference]: Start difference. First operand 11839 states and 18106 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:58,368 INFO L93 Difference]: Finished difference Result 35100 states and 53980 transitions. [2025-03-03 16:19:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:58,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 113 [2025-03-03 16:19:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:58,448 INFO L225 Difference]: With dead ends: 35100 [2025-03-03 16:19:58,448 INFO L226 Difference]: Without dead ends: 23273 [2025-03-03 16:19:58,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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-03 16:19:58,484 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 164 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:58,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 375 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23273 states. [2025-03-03 16:19:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23273 to 22969. [2025-03-03 16:19:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22969 states, 18874 states have (on average 1.4047366747907173) internal successors, (26513), 20056 states have internal predecessors, (26513), 1818 states have call successors, (1818), 1165 states have call predecessors, (1818), 2276 states have return successors, (6783), 1779 states have call predecessors, (6783), 1816 states have call successors, (6783) [2025-03-03 16:20:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22969 states to 22969 states and 35114 transitions. [2025-03-03 16:20:00,020 INFO L78 Accepts]: Start accepts. Automaton has 22969 states and 35114 transitions. Word has length 113 [2025-03-03 16:20:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:00,020 INFO L471 AbstractCegarLoop]: Abstraction has 22969 states and 35114 transitions. [2025-03-03 16:20:00,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:20:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 22969 states and 35114 transitions. [2025-03-03 16:20:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 16:20:00,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:00,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:20:00,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:00,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:00,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -771358621, now seen corresponding path program 1 times [2025-03-03 16:20:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666360828] [2025-03-03 16:20:00,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:20:00,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:20:00,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:00,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:20:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666360828] [2025-03-03 16:20:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666360828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523531943] [2025-03-03 16:20:00,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:00,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:00,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:00,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:00,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:20:00,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 16:20:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 16:20:00,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:00,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:00,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 16:20:00,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523531943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:00,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101211638] [2025-03-03 16:20:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:00,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:00,384 INFO L87 Difference]: Start difference. First operand 22969 states and 35114 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 16:20:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:02,055 INFO L93 Difference]: Finished difference Result 67105 states and 103760 transitions. [2025-03-03 16:20:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2025-03-03 16:20:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:02,230 INFO L225 Difference]: With dead ends: 67105 [2025-03-03 16:20:02,230 INFO L226 Difference]: Without dead ends: 44149 [2025-03-03 16:20:02,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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-03 16:20:02,282 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 158 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 562 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-03 16:20:02,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 562 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44149 states. [2025-03-03 16:20:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44149 to 44149. [2025-03-03 16:20:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44149 states, 36247 states have (on average 1.3936601649791707) internal successors, (50516), 38542 states have internal predecessors, (50516), 3423 states have call successors, (3423), 2255 states have call predecessors, (3423), 4478 states have return successors, (13758), 3415 states have call predecessors, (13758), 3421 states have call successors, (13758) [2025-03-03 16:20:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44149 states to 44149 states and 67697 transitions. [2025-03-03 16:20:05,615 INFO L78 Accepts]: Start accepts. Automaton has 44149 states and 67697 transitions. Word has length 113 [2025-03-03 16:20:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:05,615 INFO L471 AbstractCegarLoop]: Abstraction has 44149 states and 67697 transitions. [2025-03-03 16:20:05,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 16:20:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44149 states and 67697 transitions. [2025-03-03 16:20:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 16:20:05,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:05,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:05,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:05,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:05,901 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:05,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1533980695, now seen corresponding path program 1 times [2025-03-03 16:20:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:05,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007880213] [2025-03-03 16:20:05,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:05,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:05,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:05,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:05,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007880213] [2025-03-03 16:20:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007880213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816217417] [2025-03-03 16:20:05,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:05,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:05,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:05,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:05,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:20:06,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:06,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:06,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:06,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:06,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:06,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:20:06,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:06,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816217417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:06,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:06,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:06,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143878172] [2025-03-03 16:20:06,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:06,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:06,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:06,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:06,137 INFO L87 Difference]: Start difference. First operand 44149 states and 67697 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:07,679 INFO L93 Difference]: Finished difference Result 66541 states and 101665 transitions. [2025-03-03 16:20:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2025-03-03 16:20:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:07,809 INFO L225 Difference]: With dead ends: 66541 [2025-03-03 16:20:07,809 INFO L226 Difference]: Without dead ends: 35315 [2025-03-03 16:20:07,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 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-03 16:20:07,879 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 131 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 230 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35315 states. [2025-03-03 16:20:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35315 to 25019. [2025-03-03 16:20:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25019 states, 20933 states have (on average 1.3441933788754599) internal successors, (28138), 21662 states have internal predecessors, (28138), 1995 states have call successors, (1995), 1403 states have call predecessors, (1995), 2090 states have return successors, (4688), 1985 states have call predecessors, (4688), 1993 states have call successors, (4688) [2025-03-03 16:20:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25019 states to 25019 states and 34821 transitions. [2025-03-03 16:20:09,916 INFO L78 Accepts]: Start accepts. Automaton has 25019 states and 34821 transitions. Word has length 165 [2025-03-03 16:20:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:09,916 INFO L471 AbstractCegarLoop]: Abstraction has 25019 states and 34821 transitions. [2025-03-03 16:20:09,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25019 states and 34821 transitions. [2025-03-03 16:20:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 16:20:09,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:09,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:09,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 16:20:10,158 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:10,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash 134688656, now seen corresponding path program 1 times [2025-03-03 16:20:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617452313] [2025-03-03 16:20:10,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:10,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:10,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:10,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617452313] [2025-03-03 16:20:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617452313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633333099] [2025-03-03 16:20:10,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:10,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:10,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 16:20:10,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:10,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:10,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:10,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:10,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:10,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 16:20:10,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633333099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:10,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97375016] [2025-03-03 16:20:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:10,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:10,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:10,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:10,389 INFO L87 Difference]: Start difference. First operand 25019 states and 34821 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:11,915 INFO L93 Difference]: Finished difference Result 41612 states and 58441 transitions. [2025-03-03 16:20:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2025-03-03 16:20:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:11,992 INFO L225 Difference]: With dead ends: 41612 [2025-03-03 16:20:11,993 INFO L226 Difference]: Without dead ends: 21172 [2025-03-03 16:20:12,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 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-03 16:20:12,035 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 146 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:12,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 231 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21172 states. [2025-03-03 16:20:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21172 to 15596. [2025-03-03 16:20:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15596 states, 13256 states have (on average 1.302278213639107) internal successors, (17263), 13490 states have internal predecessors, (17263), 1225 states have call successors, (1225), 907 states have call predecessors, (1225), 1114 states have return successors, (1988), 1214 states have call predecessors, (1988), 1223 states have call successors, (1988) [2025-03-03 16:20:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15596 states to 15596 states and 20476 transitions. [2025-03-03 16:20:12,792 INFO L78 Accepts]: Start accepts. Automaton has 15596 states and 20476 transitions. Word has length 165 [2025-03-03 16:20:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:12,793 INFO L471 AbstractCegarLoop]: Abstraction has 15596 states and 20476 transitions. [2025-03-03 16:20:12,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15596 states and 20476 transitions. [2025-03-03 16:20:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 16:20:12,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:12,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:20:12,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:13,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:13,011 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:13,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash -841686863, now seen corresponding path program 1 times [2025-03-03 16:20:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:13,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895642413] [2025-03-03 16:20:13,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:13,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:13,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:13,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895642413] [2025-03-03 16:20:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895642413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:13,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102428804] [2025-03-03 16:20:13,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:13,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:13,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 16:20:13,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:13,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:13,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:13,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 16:20:13,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102428804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131365903] [2025-03-03 16:20:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:13,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:13,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:13,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:13,186 INFO L87 Difference]: Start difference. First operand 15596 states and 20476 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:13,920 INFO L93 Difference]: Finished difference Result 27463 states and 35977 transitions. [2025-03-03 16:20:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 165 [2025-03-03 16:20:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:13,976 INFO L225 Difference]: With dead ends: 27463 [2025-03-03 16:20:13,976 INFO L226 Difference]: Without dead ends: 16574 [2025-03-03 16:20:13,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 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-03 16:20:13,996 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 130 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:13,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 413 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:20:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16574 states. [2025-03-03 16:20:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16574 to 16459. [2025-03-03 16:20:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16459 states, 14073 states have (on average 1.2816030697079515) internal successors, (18036), 14307 states have internal predecessors, (18036), 1225 states have call successors, (1225), 953 states have call predecessors, (1225), 1160 states have return successors, (2034), 1214 states have call predecessors, (2034), 1223 states have call successors, (2034) [2025-03-03 16:20:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16459 states to 16459 states and 21295 transitions. [2025-03-03 16:20:14,738 INFO L78 Accepts]: Start accepts. Automaton has 16459 states and 21295 transitions. Word has length 165 [2025-03-03 16:20:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:14,739 INFO L471 AbstractCegarLoop]: Abstraction has 16459 states and 21295 transitions. [2025-03-03 16:20:14,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16459 states and 21295 transitions. [2025-03-03 16:20:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 16:20:14,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:14,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:14,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 16:20:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:20:14,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 670984233, now seen corresponding path program 1 times [2025-03-03 16:20:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:14,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133139070] [2025-03-03 16:20:14,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:14,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133139070] [2025-03-03 16:20:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133139070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128567673] [2025-03-03 16:20:15,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:15,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:15,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 16:20:15,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:15,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:15,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:15,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 16:20:15,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:15,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128567673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:15,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:15,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:15,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977198081] [2025-03-03 16:20:15,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:15,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:15,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:15,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:15,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:15,113 INFO L87 Difference]: Start difference. First operand 16459 states and 21295 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:16,366 INFO L93 Difference]: Finished difference Result 47009 states and 61519 transitions. [2025-03-03 16:20:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 16:20:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:16,476 INFO L225 Difference]: With dead ends: 47009 [2025-03-03 16:20:16,476 INFO L226 Difference]: Without dead ends: 30569 [2025-03-03 16:20:16,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 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-03 16:20:16,510 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 153 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 553 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-03 16:20:16,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 553 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30569 states. [2025-03-03 16:20:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30569 to 30565. [2025-03-03 16:20:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30565 states, 26037 states have (on average 1.273188155317433) internal successors, (33150), 26504 states have internal predecessors, (33150), 2327 states have call successors, (2327), 1785 states have call predecessors, (2327), 2200 states have return successors, (4418), 2307 states have call predecessors, (4418), 2325 states have call successors, (4418) [2025-03-03 16:20:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30565 states to 30565 states and 39895 transitions. [2025-03-03 16:20:18,084 INFO L78 Accepts]: Start accepts. Automaton has 30565 states and 39895 transitions. Word has length 166 [2025-03-03 16:20:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 30565 states and 39895 transitions. [2025-03-03 16:20:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30565 states and 39895 transitions. [2025-03-03 16:20:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:20:18,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:18,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:18,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 16:20:18,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 16:20:18,316 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:18,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash -263923686, now seen corresponding path program 1 times [2025-03-03 16:20:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:18,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145728856] [2025-03-03 16:20:18,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:18,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:18,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:18,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:18,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 16:20:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145728856] [2025-03-03 16:20:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145728856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759764569] [2025-03-03 16:20:18,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:18,373 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:18,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 16:20:18,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:18,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:18,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:18,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 16:20:18,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:18,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759764569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:18,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:18,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363689623] [2025-03-03 16:20:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:18,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:18,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:18,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:18,496 INFO L87 Difference]: Start difference. First operand 30565 states and 39895 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:19,602 INFO L93 Difference]: Finished difference Result 52821 states and 69997 transitions. [2025-03-03 16:20:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 167 [2025-03-03 16:20:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:19,677 INFO L225 Difference]: With dead ends: 52821 [2025-03-03 16:20:19,677 INFO L226 Difference]: Without dead ends: 25203 [2025-03-03 16:20:19,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 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-03 16:20:19,716 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 152 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 229 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-03 16:20:19,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 229 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25203 states. [2025-03-03 16:20:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25203 to 23763. [2025-03-03 16:20:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23763 states, 20347 states have (on average 1.2395439131075834) internal successors, (25221), 20590 states have internal predecessors, (25221), 1823 states have call successors, (1823), 1401 states have call predecessors, (1823), 1592 states have return successors, (2897), 1787 states have call predecessors, (2897), 1821 states have call successors, (2897) [2025-03-03 16:20:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23763 states to 23763 states and 29941 transitions. [2025-03-03 16:20:20,851 INFO L78 Accepts]: Start accepts. Automaton has 23763 states and 29941 transitions. Word has length 167 [2025-03-03 16:20:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:20,854 INFO L471 AbstractCegarLoop]: Abstraction has 23763 states and 29941 transitions. [2025-03-03 16:20:20,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 23763 states and 29941 transitions. [2025-03-03 16:20:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:20:20,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:20,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:20:20,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:21,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 16:20:21,077 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:21,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2061374908, now seen corresponding path program 1 times [2025-03-03 16:20:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509915924] [2025-03-03 16:20:21,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:21,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:21,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 16:20:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509915924] [2025-03-03 16:20:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509915924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355279343] [2025-03-03 16:20:21,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:21,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:21,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:21,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:21,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 16:20:21,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:21,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:21,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:21,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 16:20:21,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355279343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:21,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104044356] [2025-03-03 16:20:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:21,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:21,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:21,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:21,227 INFO L87 Difference]: Start difference. First operand 23763 states and 29941 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:23,039 INFO L93 Difference]: Finished difference Result 67661 states and 86206 transitions. [2025-03-03 16:20:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 167 [2025-03-03 16:20:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:23,188 INFO L225 Difference]: With dead ends: 67661 [2025-03-03 16:20:23,189 INFO L226 Difference]: Without dead ends: 43925 [2025-03-03 16:20:23,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 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-03 16:20:23,253 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 159 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 546 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-03 16:20:23,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 546 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43925 states. [2025-03-03 16:20:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43925 to 43921. [2025-03-03 16:20:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43921 states, 37461 states have (on average 1.228050505859427) internal successors, (46004), 37946 states have internal predecessors, (46004), 3459 states have call successors, (3459), 2617 states have call predecessors, (3459), 3000 states have return successors, (6297), 3389 states have call predecessors, (6297), 3457 states have call successors, (6297) [2025-03-03 16:20:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43921 states to 43921 states and 55760 transitions. [2025-03-03 16:20:26,002 INFO L78 Accepts]: Start accepts. Automaton has 43921 states and 55760 transitions. Word has length 167 [2025-03-03 16:20:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:26,003 INFO L471 AbstractCegarLoop]: Abstraction has 43921 states and 55760 transitions. [2025-03-03 16:20:26,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 43921 states and 55760 transitions. [2025-03-03 16:20:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:20:26,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:26,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:26,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 16:20:26,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 16:20:26,244 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:26,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1192995376, now seen corresponding path program 1 times [2025-03-03 16:20:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158017826] [2025-03-03 16:20:26,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:26,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:26,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:26,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 16:20:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158017826] [2025-03-03 16:20:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158017826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106418923] [2025-03-03 16:20:26,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:26,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:26,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:26,311 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:26,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 16:20:26,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:26,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:26,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:26,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:26,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:20:26,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106418923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:26,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126608627] [2025-03-03 16:20:26,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:26,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:26,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:26,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:26,447 INFO L87 Difference]: Start difference. First operand 43921 states and 55760 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)