./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.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.08.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 e8ee20bd48f38d06d172550f7b4afad7a85599a8fd397bba890e4eeccd52db93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:20:15,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:20:15,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:20:15,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:20:15,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:20:15,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:20:15,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:20:15,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:20:15,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:20:15,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:20:15,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:20:15,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:20:15,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:20:15,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:20:15,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:20:15,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:20:15,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:20:15,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:20:15,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:20:15,789 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 -> e8ee20bd48f38d06d172550f7b4afad7a85599a8fd397bba890e4eeccd52db93 [2025-03-03 16:20:15,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:20:16,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:20:16,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:20:16,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:20:16,005 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:20:16,005 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.08.cil-2.c [2025-03-03 16:20:17,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7cb9128e/e15b251cbde742e9a7a577270849bfbd/FLAG22b2cb140 [2025-03-03 16:20:17,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:20:17,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2025-03-03 16:20:17,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7cb9128e/e15b251cbde742e9a7a577270849bfbd/FLAG22b2cb140 [2025-03-03 16:20:17,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7cb9128e/e15b251cbde742e9a7a577270849bfbd [2025-03-03 16:20:17,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:20:17,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:20:17,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:20:17,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:20:17,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:20:17,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17, skipping insertion in model container [2025-03-03 16:20:17,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:20:17,615 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.08.cil-2.c[913,926] [2025-03-03 16:20:17,650 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.08.cil-2.c[5977,5990] [2025-03-03 16:20:17,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:20:17,724 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:20:17,731 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.08.cil-2.c[913,926] [2025-03-03 16:20:17,744 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.08.cil-2.c[5977,5990] [2025-03-03 16:20:17,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:20:17,785 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:20:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17 WrapperNode [2025-03-03 16:20:17,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:20:17,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:20:17,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:20:17,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:20:17,790 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:20:17" (1/1) ... [2025-03-03 16:20:17,802 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:20:17" (1/1) ... [2025-03-03 16:20:17,843 INFO L138 Inliner]: procedures = 64, calls = 73, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 804 [2025-03-03 16:20:17,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:20:17,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:20:17,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:20:17,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:20:17,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,883 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:20:17,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:20:17,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:20:17,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:20:17,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:20:17,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (1/1) ... [2025-03-03 16:20:17,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:20:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:17,935 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:20:17,938 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:20:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:20:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:20:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:20:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-03 16:20:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-03 16:20:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:20:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:20:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:20:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:20:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:20:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:20:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:20:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:20:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:20:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:20:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:20:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:20:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:20:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:20:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:20:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:20:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:20:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:20:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:20:18,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:20:18,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:20:18,713 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-03 16:20:18,714 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:20:18,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:20:18,731 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:20:18,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:20:18 BoogieIcfgContainer [2025-03-03 16:20:18,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:20:18,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:20:18,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:20:18,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:20:18,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:20:17" (1/3) ... [2025-03-03 16:20:18,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b23014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:20:18, skipping insertion in model container [2025-03-03 16:20:18,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:17" (2/3) ... [2025-03-03 16:20:18,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b23014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:20:18, skipping insertion in model container [2025-03-03 16:20:18,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:20:18" (3/3) ... [2025-03-03 16:20:18,739 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2025-03-03 16:20:18,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:20:18,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.08.cil-2.c that has 11 procedures, 382 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-03 16:20:18,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:20:18,812 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;@3d9a31b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:20:18,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:20:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 339 states have (on average 1.5545722713864307) internal successors, (527), 346 states have internal predecessors, (527), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:20:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:20:18,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:18,824 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:20:18,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:18,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -562314914, now seen corresponding path program 1 times [2025-03-03 16:20:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688433282] [2025-03-03 16:20:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:20:18,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:20:18,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:18,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:19,001 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:20:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688433282] [2025-03-03 16:20:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688433282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:19,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498880872] [2025-03-03 16:20:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:19,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:19,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:19,031 INFO L87 Difference]: Start difference. First operand has 382 states, 339 states have (on average 1.5545722713864307) internal successors, (527), 346 states have internal predecessors, (527), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) 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:20:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:19,102 INFO L93 Difference]: Finished difference Result 741 states and 1136 transitions. [2025-03-03 16:20:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:19,106 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:20:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:19,117 INFO L225 Difference]: With dead ends: 741 [2025-03-03 16:20:19,118 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 16:20:19,123 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:20:19,126 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 95 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1028 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:20:19,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1028 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 16:20:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-03 16:20:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 331 states have (on average 1.5075528700906344) internal successors, (499), 335 states have internal predecessors, (499), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 16:20:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 555 transitions. [2025-03-03 16:20:19,194 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 555 transitions. Word has length 44 [2025-03-03 16:20:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:19,195 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 555 transitions. [2025-03-03 16:20:19,196 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:20:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 555 transitions. [2025-03-03 16:20:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:20:19,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:19,198 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:20:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:20:19,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 360368669, now seen corresponding path program 1 times [2025-03-03 16:20:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618492951] [2025-03-03 16:20:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:19,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:20:19,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:20:19,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:19,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:19,284 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:20:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618492951] [2025-03-03 16:20:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618492951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:19,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:19,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:19,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533106807] [2025-03-03 16:20:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:19,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:19,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:19,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:19,289 INFO L87 Difference]: Start difference. First operand 371 states and 555 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:20:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:19,339 INFO L93 Difference]: Finished difference Result 495 states and 727 transitions. [2025-03-03 16:20:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:19,339 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:20:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:19,345 INFO L225 Difference]: With dead ends: 495 [2025-03-03 16:20:19,346 INFO L226 Difference]: Without dead ends: 431 [2025-03-03 16:20:19,346 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:20:19,349 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 534 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 651 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:20:19,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 651 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-03 16:20:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2025-03-03 16:20:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 381 states have (on average 1.4829396325459319) internal successors, (565), 385 states have internal predecessors, (565), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (34), 30 states have call predecessors, (34), 30 states have call successors, (34) [2025-03-03 16:20:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 633 transitions. [2025-03-03 16:20:19,395 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 633 transitions. Word has length 44 [2025-03-03 16:20:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:19,396 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 633 transitions. [2025-03-03 16:20:19,396 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:20:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2025-03-03 16:20:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 16:20:19,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:19,397 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:20:19,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:20:19,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:19,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 822127114, now seen corresponding path program 1 times [2025-03-03 16:20:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:19,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637635220] [2025-03-03 16:20:19,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:19,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 16:20:19,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 16:20:19,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:19,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:19,502 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:20:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:19,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637635220] [2025-03-03 16:20:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637635220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875255912] [2025-03-03 16:20:19,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:19,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:19,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:19,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:19,505 INFO L87 Difference]: Start difference. First operand 427 states and 633 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:20:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:19,549 INFO L93 Difference]: Finished difference Result 655 states and 953 transitions. [2025-03-03 16:20:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:19,550 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:20:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:19,553 INFO L225 Difference]: With dead ends: 655 [2025-03-03 16:20:19,553 INFO L226 Difference]: Without dead ends: 537 [2025-03-03 16:20:19,555 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:20:19,557 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 530 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 633 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:20:19,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 633 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-03 16:20:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2025-03-03 16:20:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 475 states have (on average 1.4505263157894737) internal successors, (689), 479 states have internal predecessors, (689), 42 states have call successors, (42), 16 states have call predecessors, (42), 14 states have return successors, (46), 38 states have call predecessors, (46), 38 states have call successors, (46) [2025-03-03 16:20:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 777 transitions. [2025-03-03 16:20:19,589 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 777 transitions. Word has length 45 [2025-03-03 16:20:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:19,589 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 777 transitions. [2025-03-03 16:20:19,589 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:20:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 777 transitions. [2025-03-03 16:20:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:20:19,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:19,590 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:20:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:20:19,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 243275447, now seen corresponding path program 1 times [2025-03-03 16:20:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577592463] [2025-03-03 16:20:19,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:19,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:20:19,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:20:19,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:19,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:19,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:20:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577592463] [2025-03-03 16:20:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577592463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083890713] [2025-03-03 16:20:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:19,647 INFO L87 Difference]: Start difference. First operand 533 states and 777 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:20:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:19,690 INFO L93 Difference]: Finished difference Result 941 states and 1330 transitions. [2025-03-03 16:20:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:19,691 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:20:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:19,695 INFO L225 Difference]: With dead ends: 941 [2025-03-03 16:20:19,695 INFO L226 Difference]: Without dead ends: 717 [2025-03-03 16:20:19,696 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:20:19,696 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 67 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1112 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,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1112 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,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-03 16:20:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 658. [2025-03-03 16:20:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 588 states have (on average 1.4251700680272108) internal successors, (838), 594 states have internal predecessors, (838), 48 states have call successors, (48), 22 states have call predecessors, (48), 20 states have return successors, (54), 42 states have call predecessors, (54), 44 states have call successors, (54) [2025-03-03 16:20:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 940 transitions. [2025-03-03 16:20:19,759 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 940 transitions. Word has length 46 [2025-03-03 16:20:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 940 transitions. [2025-03-03 16:20:19,760 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:20:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 940 transitions. [2025-03-03 16:20:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:20:19,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:19,763 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:20:19,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:20:19,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1632534237, now seen corresponding path program 1 times [2025-03-03 16:20:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997322770] [2025-03-03 16:20:19,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:19,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:20:19,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:20:19,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:19,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:19,854 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:20:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997322770] [2025-03-03 16:20:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997322770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596532440] [2025-03-03 16:20:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:19,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:19,856 INFO L87 Difference]: Start difference. First operand 658 states and 940 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:20:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:19,898 INFO L93 Difference]: Finished difference Result 947 states and 1331 transitions. [2025-03-03 16:20:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:19,899 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:20:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:19,903 INFO L225 Difference]: With dead ends: 947 [2025-03-03 16:20:19,903 INFO L226 Difference]: Without dead ends: 719 [2025-03-03 16:20:19,905 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:20:19,906 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 55 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1159 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:20:19,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1159 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-03 16:20:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2025-03-03 16:20:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 641 states have (on average 1.4009360374414976) internal successors, (898), 647 states have internal predecessors, (898), 53 states have call successors, (53), 25 states have call predecessors, (53), 23 states have return successors, (62), 47 states have call predecessors, (62), 49 states have call successors, (62) [2025-03-03 16:20:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1013 transitions. [2025-03-03 16:20:19,942 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1013 transitions. Word has length 63 [2025-03-03 16:20:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:19,942 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1013 transitions. [2025-03-03 16:20:19,942 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:20:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1013 transitions. [2025-03-03 16:20:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:20:19,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:19,945 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:20:19,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:20:19,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -805098369, now seen corresponding path program 1 times [2025-03-03 16:20:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-03 16:20:19,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:19,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:20:19,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:20:19,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:20,000 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:20:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-03 16:20:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365310156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:20,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480749571] [2025-03-03 16:20:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:20,002 INFO L87 Difference]: Start difference. First operand 719 states and 1013 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:20:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:20,045 INFO L93 Difference]: Finished difference Result 1193 states and 1635 transitions. [2025-03-03 16:20:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:20,046 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:20:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:20,051 INFO L225 Difference]: With dead ends: 1193 [2025-03-03 16:20:20,051 INFO L226 Difference]: Without dead ends: 832 [2025-03-03 16:20:20,052 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:20:20,052 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 517 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 640 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:20:20,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 640 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-03 16:20:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-03 16:20:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 742 states have (on average 1.3706199460916442) internal successors, (1017), 748 states have internal predecessors, (1017), 60 states have call successors, (60), 30 states have call predecessors, (60), 28 states have return successors, (72), 54 states have call predecessors, (72), 56 states have call successors, (72) [2025-03-03 16:20:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1149 transitions. [2025-03-03 16:20:20,096 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1149 transitions. Word has length 68 [2025-03-03 16:20:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1149 transitions. [2025-03-03 16:20:20,096 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:20:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1149 transitions. [2025-03-03 16:20:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:20:20,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:20,097 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:20:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:20:20,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:20,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1094113247, now seen corresponding path program 1 times [2025-03-03 16:20:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424908978] [2025-03-03 16:20:20,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:20,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:20:20,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:20:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:20,190 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:20:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424908978] [2025-03-03 16:20:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424908978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791972446] [2025-03-03 16:20:20,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:20,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:20,194 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:20:20,196 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:20:20,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:20:20,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:20:20,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:20,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:20,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 16:20:20,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:20,389 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:20:20,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:20:20,423 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:20:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791972446] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:20:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-03 16:20:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984922518] [2025-03-03 16:20:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:20,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:20:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:20,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:20:20,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:20:20,425 INFO L87 Difference]: Start difference. First operand 832 states and 1149 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:20:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:20,579 INFO L93 Difference]: Finished difference Result 889 states and 1218 transitions. [2025-03-03 16:20:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:20,579 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:20:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:20,583 INFO L225 Difference]: With dead ends: 889 [2025-03-03 16:20:20,584 INFO L226 Difference]: Without dead ends: 886 [2025-03-03 16:20:20,584 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:20:20,584 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1005 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:20,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 648 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:20:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-03 16:20:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 831. [2025-03-03 16:20:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 742 states have (on average 1.3679245283018868) internal successors, (1015), 747 states have internal predecessors, (1015), 59 states have call successors, (59), 30 states have call predecessors, (59), 28 states have return successors, (72), 54 states have call predecessors, (72), 56 states have call successors, (72) [2025-03-03 16:20:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1146 transitions. [2025-03-03 16:20:20,628 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1146 transitions. Word has length 70 [2025-03-03 16:20:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:20,629 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1146 transitions. [2025-03-03 16:20:20,629 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:20:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1146 transitions. [2025-03-03 16:20:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:20:20,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:20,631 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:20:20,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:20,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:20,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -442706166, now seen corresponding path program 1 times [2025-03-03 16:20:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-03-03 16:20:20,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:20,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:20:20,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:20:20,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:20,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:20,886 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:20:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-03-03 16:20:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240293658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374665447] [2025-03-03 16:20:20,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:20,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:20,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:20,888 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:20:20,890 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:20:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:20:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:20:20,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:20,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:20,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:20:20,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:21,207 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:20:21,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:20:21,270 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:20:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374665447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:20:21,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:20:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-03 16:20:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493293839] [2025-03-03 16:20:21,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:20:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:20:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:21,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:20:21,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:20:21,272 INFO L87 Difference]: Start difference. First operand 831 states and 1146 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:20:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:21,634 INFO L93 Difference]: Finished difference Result 2059 states and 2766 transitions. [2025-03-03 16:20:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 16:20:21,635 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:20:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:21,643 INFO L225 Difference]: With dead ends: 2059 [2025-03-03 16:20:21,643 INFO L226 Difference]: Without dead ends: 1638 [2025-03-03 16:20:21,645 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:20:21,645 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1205 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:21,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 3805 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-03 16:20:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1179. [2025-03-03 16:20:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1056 states have (on average 1.3304924242424243) internal successors, (1405), 1065 states have internal predecessors, (1405), 78 states have call successors, (78), 43 states have call predecessors, (78), 43 states have return successors, (101), 71 states have call predecessors, (101), 75 states have call successors, (101) [2025-03-03 16:20:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1584 transitions. [2025-03-03 16:20:21,721 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1584 transitions. Word has length 71 [2025-03-03 16:20:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1584 transitions. [2025-03-03 16:20:21,722 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:20:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1584 transitions. [2025-03-03 16:20:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:20:21,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:21,724 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:20:21,730 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:20:21,928 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,SelfDestructingSolverStorable7 [2025-03-03 16:20:21,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:21,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1574944144, now seen corresponding path program 1 times [2025-03-03 16:20:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:21,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790427590] [2025-03-03 16:20:21,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:21,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:21,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:20:21,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:20:21,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:21,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:21,988 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:20:21,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790427590] [2025-03-03 16:20:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790427590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896955002] [2025-03-03 16:20:21,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:21,991 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:20:21,993 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:20:22,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:20:22,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:20:22,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:22,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:22,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:22,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:22,104 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:20:22,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896955002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49174701] [2025-03-03 16:20:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:22,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:22,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:22,106 INFO L87 Difference]: Start difference. First operand 1179 states and 1584 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:20:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:22,145 INFO L93 Difference]: Finished difference Result 1772 states and 2352 transitions. [2025-03-03 16:20:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:22,145 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:20:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:22,150 INFO L225 Difference]: With dead ends: 1772 [2025-03-03 16:20:22,150 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 16:20:22,151 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:20:22,152 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 516 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 663 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:20:22,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 663 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 16:20:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1058. [2025-03-03 16:20:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 947 states have (on average 1.3326293558606124) internal successors, (1262), 957 states have internal predecessors, (1262), 71 states have call successors, (71), 38 states have call predecessors, (71), 38 states have return successors, (91), 63 states have call predecessors, (91), 68 states have call successors, (91) [2025-03-03 16:20:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1424 transitions. [2025-03-03 16:20:22,192 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1424 transitions. Word has length 90 [2025-03-03 16:20:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:22,192 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1424 transitions. [2025-03-03 16:20:22,192 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:20:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1424 transitions. [2025-03-03 16:20:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:20:22,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:22,195 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:20:22,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:22,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:22,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 538341644, now seen corresponding path program 1 times [2025-03-03 16:20:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:22,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665321158] [2025-03-03 16:20:22,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:22,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:20:22,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:20:22,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:22,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:22,450 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:20:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665321158] [2025-03-03 16:20:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665321158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764474155] [2025-03-03 16:20:22,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:22,452 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:20:22,454 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:20:22,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:20:22,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:20:22,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:22,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:22,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:22,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:22,565 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:20:22,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764474155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798336898] [2025-03-03 16:20:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:22,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:22,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:22,567 INFO L87 Difference]: Start difference. First operand 1058 states and 1424 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:20:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:22,609 INFO L93 Difference]: Finished difference Result 1376 states and 1818 transitions. [2025-03-03 16:20:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:22,610 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:20:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:22,612 INFO L225 Difference]: With dead ends: 1376 [2025-03-03 16:20:22,612 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 16:20:22,613 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:20:22,614 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 62 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1130 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:20:22,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1130 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 16:20:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 16:20:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 272 states have (on average 1.5294117647058822) internal successors, (416), 274 states have internal predecessors, (416), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 16:20:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 462 transitions. [2025-03-03 16:20:22,623 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 462 transitions. Word has length 105 [2025-03-03 16:20:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:22,623 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 462 transitions. [2025-03-03 16:20:22,623 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:20:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 462 transitions. [2025-03-03 16:20:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:22,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:22,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:22,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:22,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:22,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:22,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2101545148, now seen corresponding path program 1 times [2025-03-03 16:20:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989859193] [2025-03-03 16:20:22,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:22,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:22,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:22,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:22,936 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:20:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989859193] [2025-03-03 16:20:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989859193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450849712] [2025-03-03 16:20:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:22,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:22,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:22,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:22,937 INFO L87 Difference]: Start difference. First operand 303 states and 462 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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:20:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:23,320 INFO L93 Difference]: Finished difference Result 907 states and 1396 transitions. [2025-03-03 16:20:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:20:23,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:23,324 INFO L225 Difference]: With dead ends: 907 [2025-03-03 16:20:23,324 INFO L226 Difference]: Without dead ends: 621 [2025-03-03 16:20:23,325 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:20:23,326 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 844 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:23,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1293 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:20:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-03 16:20:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 598. [2025-03-03 16:20:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 543 states have (on average 1.5395948434622468) internal successors, (836), 546 states have internal predecessors, (836), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-03 16:20:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 917 transitions. [2025-03-03 16:20:23,345 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 917 transitions. Word has length 135 [2025-03-03 16:20:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:23,345 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 917 transitions. [2025-03-03 16:20:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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:20:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 917 transitions. [2025-03-03 16:20:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:23,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:23,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:20:23,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1512420930, now seen corresponding path program 1 times [2025-03-03 16:20:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154275434] [2025-03-03 16:20:23,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:23,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:23,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:23,471 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:20:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154275434] [2025-03-03 16:20:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154275434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:23,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:23,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225054073] [2025-03-03 16:20:23,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:23,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:23,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:23,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:23,472 INFO L87 Difference]: Start difference. First operand 598 states and 917 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:24,040 INFO L93 Difference]: Finished difference Result 1550 states and 2403 transitions. [2025-03-03 16:20:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:24,044 INFO L225 Difference]: With dead ends: 1550 [2025-03-03 16:20:24,045 INFO L226 Difference]: Without dead ends: 969 [2025-03-03 16:20:24,046 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:20:24,046 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 845 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:24,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 2509 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-03 16:20:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 874. [2025-03-03 16:20:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 795 states have (on average 1.5320754716981133) internal successors, (1218), 799 states have internal predecessors, (1218), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-03 16:20:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1336 transitions. [2025-03-03 16:20:24,082 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1336 transitions. Word has length 135 [2025-03-03 16:20:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:24,082 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1336 transitions. [2025-03-03 16:20:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1336 transitions. [2025-03-03 16:20:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:24,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:24,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:20:24,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:24,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 329403395, now seen corresponding path program 1 times [2025-03-03 16:20:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386895148] [2025-03-03 16:20:24,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:24,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:24,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:24,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:24,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:24,209 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:20:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386895148] [2025-03-03 16:20:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386895148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840506773] [2025-03-03 16:20:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:24,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:24,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:24,210 INFO L87 Difference]: Start difference. First operand 874 states and 1336 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:24,781 INFO L93 Difference]: Finished difference Result 2424 states and 3751 transitions. [2025-03-03 16:20:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:24,788 INFO L225 Difference]: With dead ends: 2424 [2025-03-03 16:20:24,788 INFO L226 Difference]: Without dead ends: 1567 [2025-03-03 16:20:24,790 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:20:24,791 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 840 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:24,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 2493 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-03 16:20:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1459. [2025-03-03 16:20:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1330 states have (on average 1.5345864661654136) internal successors, (2041), 1338 states have internal predecessors, (2041), 92 states have call successors, (92), 31 states have call predecessors, (92), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-03 16:20:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2239 transitions. [2025-03-03 16:20:24,872 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2239 transitions. Word has length 135 [2025-03-03 16:20:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:24,872 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2239 transitions. [2025-03-03 16:20:24,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2239 transitions. [2025-03-03 16:20:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:24,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:24,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:20:24,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -817137118, now seen corresponding path program 1 times [2025-03-03 16:20:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114340765] [2025-03-03 16:20:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:24,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:24,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:24,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:24,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:24,987 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:20:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114340765] [2025-03-03 16:20:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114340765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619072180] [2025-03-03 16:20:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:24,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:24,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:24,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:24,989 INFO L87 Difference]: Start difference. First operand 1459 states and 2239 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:25,560 INFO L93 Difference]: Finished difference Result 4299 states and 6704 transitions. [2025-03-03 16:20:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:25,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:25,571 INFO L225 Difference]: With dead ends: 4299 [2025-03-03 16:20:25,571 INFO L226 Difference]: Without dead ends: 2857 [2025-03-03 16:20:25,574 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:20:25,575 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 835 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:25,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2481 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:20:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2025-03-03 16:20:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2722. [2025-03-03 16:20:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2487 states have (on average 1.5492561318858062) internal successors, (3853), 2509 states have internal predecessors, (3853), 160 states have call successors, (160), 55 states have call predecessors, (160), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-03 16:20:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 4235 transitions. [2025-03-03 16:20:25,712 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 4235 transitions. Word has length 135 [2025-03-03 16:20:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:25,712 INFO L471 AbstractCegarLoop]: Abstraction has 2722 states and 4235 transitions. [2025-03-03 16:20:25,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 4235 transitions. [2025-03-03 16:20:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:25,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:25,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:25,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:20:25,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2101048285, now seen corresponding path program 1 times [2025-03-03 16:20:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676330228] [2025-03-03 16:20:25,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:25,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:25,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:25,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:25,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:25,812 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:20:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676330228] [2025-03-03 16:20:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676330228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:25,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156460389] [2025-03-03 16:20:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:25,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:25,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:25,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:25,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:25,815 INFO L87 Difference]: Start difference. First operand 2722 states and 4235 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:26,418 INFO L93 Difference]: Finished difference Result 8402 states and 13358 transitions. [2025-03-03 16:20:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:26,443 INFO L225 Difference]: With dead ends: 8402 [2025-03-03 16:20:26,443 INFO L226 Difference]: Without dead ends: 5697 [2025-03-03 16:20:26,453 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:20:26,454 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 830 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:26,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 2469 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2025-03-03 16:20:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 5509. [2025-03-03 16:20:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5044 states have (on average 1.574345757335448) internal successors, (7941), 5112 states have internal predecessors, (7941), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-03 16:20:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 8787 transitions. [2025-03-03 16:20:26,674 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 8787 transitions. Word has length 135 [2025-03-03 16:20:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:26,674 INFO L471 AbstractCegarLoop]: Abstraction has 5509 states and 8787 transitions. [2025-03-03 16:20:26,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 8787 transitions. [2025-03-03 16:20:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:26,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:26,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:26,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:20:26,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1865370110, now seen corresponding path program 1 times [2025-03-03 16:20:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060505557] [2025-03-03 16:20:26,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:26,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:26,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:26,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:26,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:26,788 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:20:26,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:26,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060505557] [2025-03-03 16:20:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060505557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:26,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872838894] [2025-03-03 16:20:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:26,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:26,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:26,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:26,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:26,791 INFO L87 Difference]: Start difference. First operand 5509 states and 8787 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:20:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:27,203 INFO L93 Difference]: Finished difference Result 12163 states and 19913 transitions. [2025-03-03 16:20:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:27,241 INFO L225 Difference]: With dead ends: 12163 [2025-03-03 16:20:27,241 INFO L226 Difference]: Without dead ends: 6671 [2025-03-03 16:20:27,256 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:20:27,257 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 605 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:27,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 916 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2025-03-03 16:20:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 5509. [2025-03-03 16:20:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5044 states have (on average 1.570975416336241) internal successors, (7924), 5112 states have internal predecessors, (7924), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-03 16:20:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 8770 transitions. [2025-03-03 16:20:27,597 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 8770 transitions. Word has length 135 [2025-03-03 16:20:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 5509 states and 8770 transitions. [2025-03-03 16:20:27,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:20:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 8770 transitions. [2025-03-03 16:20:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:27,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:27,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:27,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:20:27,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1605915715, now seen corresponding path program 1 times [2025-03-03 16:20:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:27,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164083033] [2025-03-03 16:20:27,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:27,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:27,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:27,689 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:20:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:27,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164083033] [2025-03-03 16:20:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164083033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:27,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:27,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184216700] [2025-03-03 16:20:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:27,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:27,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:27,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:27,692 INFO L87 Difference]: Start difference. First operand 5509 states and 8770 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:20:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:28,066 INFO L93 Difference]: Finished difference Result 11997 states and 19547 transitions. [2025-03-03 16:20:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:28,097 INFO L225 Difference]: With dead ends: 11997 [2025-03-03 16:20:28,097 INFO L226 Difference]: Without dead ends: 6505 [2025-03-03 16:20:28,112 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:20:28,112 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 601 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:28,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 902 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2025-03-03 16:20:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 5509. [2025-03-03 16:20:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5044 states have (on average 1.567605075337034) internal successors, (7907), 5112 states have internal predecessors, (7907), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-03 16:20:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 8753 transitions. [2025-03-03 16:20:28,354 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 8753 transitions. Word has length 135 [2025-03-03 16:20:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:28,356 INFO L471 AbstractCegarLoop]: Abstraction has 5509 states and 8753 transitions. [2025-03-03 16:20:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:20:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 8753 transitions. [2025-03-03 16:20:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:28,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:28,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:20:28,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1086623428, now seen corresponding path program 1 times [2025-03-03 16:20:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096518368] [2025-03-03 16:20:28,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:28,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:28,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:28,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:28,458 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:20:28,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096518368] [2025-03-03 16:20:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096518368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:28,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:28,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48245951] [2025-03-03 16:20:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:28,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:28,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:28,459 INFO L87 Difference]: Start difference. First operand 5509 states and 8753 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:29,229 INFO L93 Difference]: Finished difference Result 17293 states and 28186 transitions. [2025-03-03 16:20:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:29,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:29,269 INFO L225 Difference]: With dead ends: 17293 [2025-03-03 16:20:29,270 INFO L226 Difference]: Without dead ends: 11801 [2025-03-03 16:20:29,286 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:20:29,287 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 806 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:29,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2405 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11801 states. [2025-03-03 16:20:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11801 to 11569. [2025-03-03 16:20:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11569 states, 10590 states have (on average 1.5914069877242683) internal successors, (16853), 10804 states have internal predecessors, (16853), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-03 16:20:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11569 states to 11569 states and 19011 transitions. [2025-03-03 16:20:29,888 INFO L78 Accepts]: Start accepts. Automaton has 11569 states and 19011 transitions. Word has length 135 [2025-03-03 16:20:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:29,890 INFO L471 AbstractCegarLoop]: Abstraction has 11569 states and 19011 transitions. [2025-03-03 16:20:29,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11569 states and 19011 transitions. [2025-03-03 16:20:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:29,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:29,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:20:29,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash 100040739, now seen corresponding path program 1 times [2025-03-03 16:20:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:29,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002432782] [2025-03-03 16:20:29,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:29,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:29,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:29,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:30,019 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:20:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002432782] [2025-03-03 16:20:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002432782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:30,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:30,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917224291] [2025-03-03 16:20:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:30,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:30,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:30,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:30,022 INFO L87 Difference]: Start difference. First operand 11569 states and 19011 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:31,174 INFO L93 Difference]: Finished difference Result 39105 states and 66331 transitions. [2025-03-03 16:20:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:31,271 INFO L225 Difference]: With dead ends: 39105 [2025-03-03 16:20:31,271 INFO L226 Difference]: Without dead ends: 27553 [2025-03-03 16:20:31,301 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:20:31,301 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1055 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:31,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 2380 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27553 states. [2025-03-03 16:20:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27553 to 25132. [2025-03-03 16:20:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25132 states, 22995 states have (on average 1.620221787345075) internal successors, (37257), 23663 states have internal predecessors, (37257), 1080 states have call successors, (1080), 391 states have call predecessors, (1080), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-03 16:20:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25132 states to 25132 states and 43511 transitions. [2025-03-03 16:20:32,720 INFO L78 Accepts]: Start accepts. Automaton has 25132 states and 43511 transitions. Word has length 135 [2025-03-03 16:20:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:32,720 INFO L471 AbstractCegarLoop]: Abstraction has 25132 states and 43511 transitions. [2025-03-03 16:20:32,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25132 states and 43511 transitions. [2025-03-03 16:20:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:32,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:32,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:20:32,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1176594148, now seen corresponding path program 1 times [2025-03-03 16:20:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010631996] [2025-03-03 16:20:32,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:32,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:32,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:32,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:32,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:32,830 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:20:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:32,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010631996] [2025-03-03 16:20:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010631996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:32,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:32,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689120906] [2025-03-03 16:20:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:32,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:32,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:32,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:32,832 INFO L87 Difference]: Start difference. First operand 25132 states and 43511 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:35,048 INFO L93 Difference]: Finished difference Result 85618 states and 155493 transitions. [2025-03-03 16:20:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:35,335 INFO L225 Difference]: With dead ends: 85618 [2025-03-03 16:20:35,336 INFO L226 Difference]: Without dead ends: 60503 [2025-03-03 16:20:35,416 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:20:35,418 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 868 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:35,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 2364 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60503 states. [2025-03-03 16:20:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60503 to 55589. [2025-03-03 16:20:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55589 states, 50682 states have (on average 1.64865238151612) internal successors, (83557), 52744 states have internal predecessors, (83557), 2072 states have call successors, (2072), 775 states have call predecessors, (2072), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-03 16:20:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55589 states to 55589 states and 104083 transitions. [2025-03-03 16:20:38,498 INFO L78 Accepts]: Start accepts. Automaton has 55589 states and 104083 transitions. Word has length 135 [2025-03-03 16:20:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:38,498 INFO L471 AbstractCegarLoop]: Abstraction has 55589 states and 104083 transitions. [2025-03-03 16:20:38,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 55589 states and 104083 transitions. [2025-03-03 16:20:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:38,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:38,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:20:38,517 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:38,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1282530301, now seen corresponding path program 1 times [2025-03-03 16:20:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:38,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335334018] [2025-03-03 16:20:38,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:38,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:38,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:38,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:38,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:38,600 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:20:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335334018] [2025-03-03 16:20:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335334018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555925264] [2025-03-03 16:20:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:38,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:38,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:38,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:38,602 INFO L87 Difference]: Start difference. First operand 55589 states and 104083 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:44,766 INFO L93 Difference]: Finished difference Result 190993 states and 384107 transitions. [2025-03-03 16:20:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:44,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 135 [2025-03-03 16:20:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:45,389 INFO L225 Difference]: With dead ends: 190993 [2025-03-03 16:20:45,389 INFO L226 Difference]: Without dead ends: 135421 [2025-03-03 16:20:45,517 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:20:45,517 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 985 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:45,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 2356 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:20:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135421 states. [2025-03-03 16:20:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135421 to 127950. [2025-03-03 16:20:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127950 states, 116109 states have (on average 1.6766745041297402) internal successors, (194677), 122417 states have internal predecessors, (194677), 3992 states have call successors, (3992), 1543 states have call predecessors, (3992), 7848 states have return successors, (69526), 4245 states have call predecessors, (69526), 3990 states have call successors, (69526) [2025-03-03 16:20:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127950 states to 127950 states and 268195 transitions. [2025-03-03 16:20:52,876 INFO L78 Accepts]: Start accepts. Automaton has 127950 states and 268195 transitions. Word has length 135 [2025-03-03 16:20:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 127950 states and 268195 transitions. [2025-03-03 16:20:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:20:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 127950 states and 268195 transitions. [2025-03-03 16:20:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:20:52,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:52,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:52,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:20:52,907 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1223309564, now seen corresponding path program 1 times [2025-03-03 16:20:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982746244] [2025-03-03 16:20:52,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:52,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:20:52,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:20:52,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:52,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:52,987 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:20:52,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982746244] [2025-03-03 16:20:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982746244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:52,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601849951] [2025-03-03 16:20:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:52,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:52,989 INFO L87 Difference]: Start difference. First operand 127950 states and 268195 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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)