./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.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.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5431a1a166986f09cf6e8d9d49f276cd283b8e2ac68f401ad73509be5780b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:20:29,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:20:29,557 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:29,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:20:29,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:20:29,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:20:29,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:20:29,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:20:29,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:20:29,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:20:29,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:20:29,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:20:29,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:20:29,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:20:29,587 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:20:29,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:20:29,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:20:29,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:20:29,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:20:29,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:20:29,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:20:29,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:20:29,590 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 -> ff5431a1a166986f09cf6e8d9d49f276cd283b8e2ac68f401ad73509be5780b8 [2025-03-03 16:20:29,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:20:29,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:20:29,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:20:29,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:20:29,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:20:29,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2025-03-03 16:20:31,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0fcce45/4fe1e5b3dab24a2f921a852938d7ed28/FLAG0e00b7e66 [2025-03-03 16:20:31,337 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:20:31,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2025-03-03 16:20:31,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0fcce45/4fe1e5b3dab24a2f921a852938d7ed28/FLAG0e00b7e66 [2025-03-03 16:20:31,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0fcce45/4fe1e5b3dab24a2f921a852938d7ed28 [2025-03-03 16:20:31,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:20:31,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:20:31,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:20:31,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:20:31,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:20:31,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:20:31" (1/1) ... [2025-03-03 16:20:31,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9738fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:31, skipping insertion in model container [2025-03-03 16:20:31,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:20:31" (1/1) ... [2025-03-03 16:20:31,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:20:31,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[913,926] [2025-03-03 16:20:31,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[5977,5990] [2025-03-03 16:20:31,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:20:31,897 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:20:31,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[913,926] [2025-03-03 16:20:31,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[5977,5990] [2025-03-03 16:20:31,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:20:31,984 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:20:31,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:31 WrapperNode [2025-03-03 16:20:31,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:20:31,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:20:31,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:20:31,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:20:31,991 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:31" (1/1) ... [2025-03-03 16:20:32,006 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:31" (1/1) ... [2025-03-03 16:20:32,056 INFO L138 Inliner]: procedures = 70, calls = 82, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 975 [2025-03-03 16:20:32,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:20:32,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:20:32,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:20:32,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:20:32,066 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:31" (1/1) ... [2025-03-03 16:20:32,066 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:31" (1/1) ... [2025-03-03 16:20:32,071 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:31" (1/1) ... [2025-03-03 16:20:32,097 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:32,097 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:31" (1/1) ... [2025-03-03 16:20:32,097 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:31" (1/1) ... [2025-03-03 16:20:32,110 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:31" (1/1) ... [2025-03-03 16:20:32,115 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:31" (1/1) ... [2025-03-03 16:20:32,117 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:31" (1/1) ... [2025-03-03 16:20:32,122 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:31" (1/1) ... [2025-03-03 16:20:32,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:20:32,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:20:32,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:20:32,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:20:32,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:31" (1/1) ... [2025-03-03 16:20:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:20:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:32,159 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:32,162 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:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:20:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:20:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:20:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-03 16:20:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-03 16:20:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:20:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:20:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:20:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:20:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:20:32,303 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:20:32,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:20:32,989 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-03-03 16:20:32,989 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:20:33,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:20:33,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:20:33,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:20:33 BoogieIcfgContainer [2025-03-03 16:20:33,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:20:33,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:20:33,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:20:33,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:20:33,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:20:31" (1/3) ... [2025-03-03 16:20:33,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6580e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:20:33, skipping insertion in model container [2025-03-03 16:20:33,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:31" (2/3) ... [2025-03-03 16:20:33,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6580e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:20:33, skipping insertion in model container [2025-03-03 16:20:33,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:20:33" (3/3) ... [2025-03-03 16:20:33,016 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2025-03-03 16:20:33,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:20:33,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.11.cil-1.c that has 11 procedures, 463 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-03-03 16:20:33,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:20:33,075 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;@52b39545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:20:33,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:20:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 417 states have (on average 1.565947242206235) internal successors, (653), 424 states have internal predecessors, (653), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 16:20:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:20:33,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:33,086 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:33,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:33,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1067270017, now seen corresponding path program 1 times [2025-03-03 16:20:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745282592] [2025-03-03 16:20:33,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:33,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:20:33,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:20:33,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:33,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:33,283 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:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:33,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745282592] [2025-03-03 16:20:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745282592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76706366] [2025-03-03 16:20:33,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:33,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:33,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:33,303 INFO L87 Difference]: Start difference. First operand has 463 states, 417 states have (on average 1.565947242206235) internal successors, (653), 424 states have internal predecessors, (653), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) 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:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:33,367 INFO L93 Difference]: Finished difference Result 900 states and 1394 transitions. [2025-03-03 16:20:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:33,369 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:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:33,377 INFO L225 Difference]: With dead ends: 900 [2025-03-03 16:20:33,377 INFO L226 Difference]: Without dead ends: 452 [2025-03-03 16:20:33,383 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:33,385 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 95 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1286 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:33,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1286 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:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-03 16:20:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-03-03 16:20:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 409 states have (on average 1.5207823960880196) internal successors, (622), 413 states have internal predecessors, (622), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 16:20:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 684 transitions. [2025-03-03 16:20:33,436 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 684 transitions. Word has length 44 [2025-03-03 16:20:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:33,436 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 684 transitions. [2025-03-03 16:20:33,437 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:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 684 transitions. [2025-03-03 16:20:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:20:33,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:33,441 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:33,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:20:33,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:33,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1989953600, now seen corresponding path program 1 times [2025-03-03 16:20:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104763074] [2025-03-03 16:20:33,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:33,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:20:33,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:20:33,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:33,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:33,530 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:33,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:33,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104763074] [2025-03-03 16:20:33,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104763074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567001676] [2025-03-03 16:20:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:33,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:33,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:33,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:33,532 INFO L87 Difference]: Start difference. First operand 452 states and 684 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:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:33,603 INFO L93 Difference]: Finished difference Result 576 states and 856 transitions. [2025-03-03 16:20:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:33,604 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:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:33,612 INFO L225 Difference]: With dead ends: 576 [2025-03-03 16:20:33,612 INFO L226 Difference]: Without dead ends: 512 [2025-03-03 16:20:33,613 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:33,613 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 663 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 779 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:33,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 779 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:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-03 16:20:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2025-03-03 16:20:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 459 states have (on average 1.4989106753812635) internal successors, (688), 463 states have internal predecessors, (688), 37 states have call successors, (37), 12 states have call predecessors, (37), 10 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2025-03-03 16:20:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 762 transitions. [2025-03-03 16:20:33,644 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 762 transitions. Word has length 44 [2025-03-03 16:20:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:33,644 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 762 transitions. [2025-03-03 16:20:33,644 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:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 762 transitions. [2025-03-03 16:20:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 16:20:33,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:33,646 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:33,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:20:33,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2105116387, now seen corresponding path program 1 times [2025-03-03 16:20:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653471134] [2025-03-03 16:20:33,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:33,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 16:20:33,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 16:20:33,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:33,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:33,715 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:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:33,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653471134] [2025-03-03 16:20:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653471134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953743264] [2025-03-03 16:20:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:33,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:33,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:33,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:33,716 INFO L87 Difference]: Start difference. First operand 508 states and 762 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:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:33,754 INFO L93 Difference]: Finished difference Result 736 states and 1082 transitions. [2025-03-03 16:20:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:33,755 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:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:33,758 INFO L225 Difference]: With dead ends: 736 [2025-03-03 16:20:33,759 INFO L226 Difference]: Without dead ends: 618 [2025-03-03 16:20:33,759 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:33,760 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 659 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 762 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:33,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 762 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:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-03 16:20:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2025-03-03 16:20:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 553 states have (on average 1.4683544303797469) internal successors, (812), 557 states have internal predecessors, (812), 45 states have call successors, (45), 16 states have call predecessors, (45), 14 states have return successors, (49), 41 states have call predecessors, (49), 41 states have call successors, (49) [2025-03-03 16:20:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 906 transitions. [2025-03-03 16:20:33,790 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 906 transitions. Word has length 45 [2025-03-03 16:20:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:33,790 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 906 transitions. [2025-03-03 16:20:33,790 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:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 906 transitions. [2025-03-03 16:20:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:20:33,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:33,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:33,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:20:33,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:33,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2083238618, now seen corresponding path program 1 times [2025-03-03 16:20:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087041597] [2025-03-03 16:20:33,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:20:33,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:20:33,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:33,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:33,849 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:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087041597] [2025-03-03 16:20:33,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087041597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:33,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:33,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:33,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342830646] [2025-03-03 16:20:33,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:33,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:33,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:33,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:33,850 INFO L87 Difference]: Start difference. First operand 614 states and 906 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:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:33,891 INFO L93 Difference]: Finished difference Result 1022 states and 1459 transitions. [2025-03-03 16:20:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:33,892 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:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:33,897 INFO L225 Difference]: With dead ends: 1022 [2025-03-03 16:20:33,897 INFO L226 Difference]: Without dead ends: 798 [2025-03-03 16:20:33,898 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:33,899 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 67 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1370 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:33,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1370 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:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-03 16:20:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 739. [2025-03-03 16:20:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 666 states have (on average 1.442942942942943) internal successors, (961), 672 states have internal predecessors, (961), 51 states have call successors, (51), 22 states have call predecessors, (51), 20 states have return successors, (57), 45 states have call predecessors, (57), 47 states have call successors, (57) [2025-03-03 16:20:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1069 transitions. [2025-03-03 16:20:33,936 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1069 transitions. Word has length 46 [2025-03-03 16:20:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:33,936 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1069 transitions. [2025-03-03 16:20:33,936 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:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1069 transitions. [2025-03-03 16:20:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:20:33,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:33,939 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:33,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:20:33,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1846535862, now seen corresponding path program 1 times [2025-03-03 16:20:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439616841] [2025-03-03 16:20:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:33,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:20:33,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:20:33,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:33,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:34,041 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:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439616841] [2025-03-03 16:20:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439616841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523342359] [2025-03-03 16:20:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:34,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:34,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:34,043 INFO L87 Difference]: Start difference. First operand 739 states and 1069 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:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:34,080 INFO L93 Difference]: Finished difference Result 1028 states and 1460 transitions. [2025-03-03 16:20:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:34,081 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:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:34,085 INFO L225 Difference]: With dead ends: 1028 [2025-03-03 16:20:34,085 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 16:20:34,086 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:34,087 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 55 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1417 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:34,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1417 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:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 16:20:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-03-03 16:20:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 719 states have (on average 1.4200278164116829) internal successors, (1021), 725 states have internal predecessors, (1021), 56 states have call successors, (56), 25 states have call predecessors, (56), 23 states have return successors, (65), 50 states have call predecessors, (65), 52 states have call successors, (65) [2025-03-03 16:20:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1142 transitions. [2025-03-03 16:20:34,119 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1142 transitions. Word has length 63 [2025-03-03 16:20:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:34,120 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1142 transitions. [2025-03-03 16:20:34,120 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:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1142 transitions. [2025-03-03 16:20:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:20:34,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:34,122 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:34,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:20:34,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:34,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1973881734, now seen corresponding path program 1 times [2025-03-03 16:20:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:34,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576346984] [2025-03-03 16:20:34,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:34,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:20:34,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:20:34,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:34,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:34,176 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:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576346984] [2025-03-03 16:20:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576346984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843519656] [2025-03-03 16:20:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:34,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:34,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:34,178 INFO L87 Difference]: Start difference. First operand 800 states and 1142 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:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:34,218 INFO L93 Difference]: Finished difference Result 1274 states and 1764 transitions. [2025-03-03 16:20:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:34,219 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:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:34,224 INFO L225 Difference]: With dead ends: 1274 [2025-03-03 16:20:34,224 INFO L226 Difference]: Without dead ends: 913 [2025-03-03 16:20:34,225 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:34,225 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 646 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 769 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:34,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 769 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:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-03 16:20:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2025-03-03 16:20:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 820 states have (on average 1.3902439024390243) internal successors, (1140), 826 states have internal predecessors, (1140), 63 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (75), 57 states have call predecessors, (75), 59 states have call successors, (75) [2025-03-03 16:20:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1278 transitions. [2025-03-03 16:20:34,260 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1278 transitions. Word has length 68 [2025-03-03 16:20:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:34,261 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1278 transitions. [2025-03-03 16:20:34,261 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:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1278 transitions. [2025-03-03 16:20:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:20:34,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:34,262 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:34,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:20:34,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:34,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash 857521626, now seen corresponding path program 1 times [2025-03-03 16:20:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:34,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438729142] [2025-03-03 16:20:34,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:34,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:20:34,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:20:34,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:34,345 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:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438729142] [2025-03-03 16:20:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438729142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258717839] [2025-03-03 16:20:34,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:34,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:34,348 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:34,350 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:34,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:20:34,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:20:34,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:34,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:34,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 16:20:34,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:34,529 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:34,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:20:34,573 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:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258717839] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:20:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-03 16:20:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216323462] [2025-03-03 16:20:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:20:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:34,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:20:34,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:20:34,574 INFO L87 Difference]: Start difference. First operand 913 states and 1278 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:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:34,734 INFO L93 Difference]: Finished difference Result 970 states and 1347 transitions. [2025-03-03 16:20:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:34,734 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:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:34,740 INFO L225 Difference]: With dead ends: 970 [2025-03-03 16:20:34,740 INFO L226 Difference]: Without dead ends: 967 [2025-03-03 16:20:34,741 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:34,741 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 1251 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:34,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 777 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:20:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-03 16:20:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 912. [2025-03-03 16:20:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 820 states have (on average 1.3878048780487804) internal successors, (1138), 825 states have internal predecessors, (1138), 62 states have call successors, (62), 30 states have call predecessors, (62), 28 states have return successors, (75), 57 states have call predecessors, (75), 59 states have call successors, (75) [2025-03-03 16:20:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1275 transitions. [2025-03-03 16:20:34,780 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1275 transitions. Word has length 70 [2025-03-03 16:20:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:34,780 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1275 transitions. [2025-03-03 16:20:34,781 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:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1275 transitions. [2025-03-03 16:20:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:20:34,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:34,782 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:34,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:20:34,987 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:34,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:34,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 812790933, now seen corresponding path program 1 times [2025-03-03 16:20:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:34,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935581791] [2025-03-03 16:20:34,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:34,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:20:35,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:20:35,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:35,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:35,075 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:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935581791] [2025-03-03 16:20:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935581791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068714601] [2025-03-03 16:20:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:35,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:35,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:35,081 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:35,082 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:35,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:20:35,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:20:35,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:35,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:35,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:20:35,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:35,360 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:35,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:20:35,418 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:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068714601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:20:35,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:20:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-03 16:20:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960504942] [2025-03-03 16:20:35,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:20:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:20:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:20:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:20:35,420 INFO L87 Difference]: Start difference. First operand 912 states and 1275 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:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:35,773 INFO L93 Difference]: Finished difference Result 2140 states and 2895 transitions. [2025-03-03 16:20:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 16:20:35,774 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:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:35,780 INFO L225 Difference]: With dead ends: 2140 [2025-03-03 16:20:35,780 INFO L226 Difference]: Without dead ends: 1719 [2025-03-03 16:20:35,782 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:35,782 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 821 mSDsluCounter, 4608 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 5384 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:35,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 5384 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2025-03-03 16:20:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1260. [2025-03-03 16:20:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1134 states have (on average 1.347442680776014) internal successors, (1528), 1143 states have internal predecessors, (1528), 81 states have call successors, (81), 43 states have call predecessors, (81), 43 states have return successors, (104), 74 states have call predecessors, (104), 78 states have call successors, (104) [2025-03-03 16:20:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1713 transitions. [2025-03-03 16:20:35,833 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1713 transitions. Word has length 71 [2025-03-03 16:20:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:35,833 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1713 transitions. [2025-03-03 16:20:35,833 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:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1713 transitions. [2025-03-03 16:20:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:20:35,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:35,835 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:35,843 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:36,040 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:36,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:36,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 303090915, now seen corresponding path program 1 times [2025-03-03 16:20:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:36,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566860373] [2025-03-03 16:20:36,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:36,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:20:36,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:20:36,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:36,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:36,115 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:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:36,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566860373] [2025-03-03 16:20:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566860373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:36,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700223528] [2025-03-03 16:20:36,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:36,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:36,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:36,118 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:36,120 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:36,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:20:36,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:20:36,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:36,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:36,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:36,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:36,243 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:36,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:36,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700223528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:36,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:36,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697724793] [2025-03-03 16:20:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:36,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:36,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:36,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:36,244 INFO L87 Difference]: Start difference. First operand 1260 states and 1713 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:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:36,292 INFO L93 Difference]: Finished difference Result 1853 states and 2481 transitions. [2025-03-03 16:20:36,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:36,293 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:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:36,297 INFO L225 Difference]: With dead ends: 1853 [2025-03-03 16:20:36,297 INFO L226 Difference]: Without dead ends: 1156 [2025-03-03 16:20:36,298 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:36,299 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 645 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 792 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:36,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 792 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:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-03-03 16:20:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1139. [2025-03-03 16:20:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1025 states have (on average 1.351219512195122) internal successors, (1385), 1035 states have internal predecessors, (1385), 74 states have call successors, (74), 38 states have call predecessors, (74), 38 states have return successors, (94), 66 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-03 16:20:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1553 transitions. [2025-03-03 16:20:36,337 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1553 transitions. Word has length 90 [2025-03-03 16:20:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:36,338 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1553 transitions. [2025-03-03 16:20:36,338 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:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1553 transitions. [2025-03-03 16:20:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:20:36,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:36,340 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:36,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:20:36,540 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:36,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 404063295, now seen corresponding path program 1 times [2025-03-03 16:20:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040431256] [2025-03-03 16:20:36,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:36,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:20:36,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:20:36,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:36,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:36,610 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:36,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040431256] [2025-03-03 16:20:36,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040431256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610141362] [2025-03-03 16:20:36,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:36,613 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:36,614 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:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:20:36,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:20:36,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:36,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:36,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:36,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:36,724 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:36,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610141362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610216405] [2025-03-03 16:20:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:36,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:36,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:36,727 INFO L87 Difference]: Start difference. First operand 1139 states and 1553 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:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:36,768 INFO L93 Difference]: Finished difference Result 1457 states and 1947 transitions. [2025-03-03 16:20:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:36,768 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:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:36,770 INFO L225 Difference]: With dead ends: 1457 [2025-03-03 16:20:36,770 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 16:20:36,772 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:36,773 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 62 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1388 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:36,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1388 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:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 16:20:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-03 16:20:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.54) internal successors, (539), 352 states have internal predecessors, (539), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 16:20:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2025-03-03 16:20:36,786 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 105 [2025-03-03 16:20:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:36,786 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2025-03-03 16:20:36,786 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:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2025-03-03 16:20:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:36,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:36,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:36,796 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:36,993 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:36,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:36,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash 511737624, now seen corresponding path program 1 times [2025-03-03 16:20:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301763394] [2025-03-03 16:20:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:37,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:37,040 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:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301763394] [2025-03-03 16:20:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301763394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:37,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776556702] [2025-03-03 16:20:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:37,042 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:20:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:37,056 INFO L93 Difference]: Finished difference Result 757 states and 1165 transitions. [2025-03-03 16:20:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:37,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-03-03 16:20:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:37,058 INFO L225 Difference]: With dead ends: 757 [2025-03-03 16:20:37,058 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 16:20:37,059 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:37,059 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 580 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 590 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:37,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 590 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:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 16:20:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-03 16:20:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.5371428571428571) internal successors, (538), 352 states have internal predecessors, (538), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 16:20:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 590 transitions. [2025-03-03 16:20:37,070 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 590 transitions. Word has length 168 [2025-03-03 16:20:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:37,070 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 590 transitions. [2025-03-03 16:20:37,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:20:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 590 transitions. [2025-03-03 16:20:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:37,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:37,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:20:37,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:37,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2126223431, now seen corresponding path program 1 times [2025-03-03 16:20:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535803573] [2025-03-03 16:20:37,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:37,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:37,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:37,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:37,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:37,179 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:37,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:37,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535803573] [2025-03-03 16:20:37,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535803573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:37,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:37,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365551831] [2025-03-03 16:20:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:37,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:37,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:37,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:37,183 INFO L87 Difference]: Start difference. First operand 384 states and 590 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:37,673 INFO L93 Difference]: Finished difference Result 1156 states and 1794 transitions. [2025-03-03 16:20:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:20:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:37,677 INFO L225 Difference]: With dead ends: 1156 [2025-03-03 16:20:37,677 INFO L226 Difference]: Without dead ends: 792 [2025-03-03 16:20:37,678 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:37,679 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1104 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:37,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1662 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:20:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-03 16:20:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 763. [2025-03-03 16:20:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 702 states have (on average 1.5484330484330484) internal successors, (1087), 705 states have internal predecessors, (1087), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-03 16:20:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1180 transitions. [2025-03-03 16:20:37,709 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1180 transitions. Word has length 168 [2025-03-03 16:20:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:37,709 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1180 transitions. [2025-03-03 16:20:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1180 transitions. [2025-03-03 16:20:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:37,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:37,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:37,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:20:37,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash 482460471, now seen corresponding path program 1 times [2025-03-03 16:20:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:37,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966232546] [2025-03-03 16:20:37,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:37,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:37,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:37,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:37,846 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:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966232546] [2025-03-03 16:20:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966232546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:37,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471772686] [2025-03-03 16:20:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:37,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:37,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:37,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:37,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:37,848 INFO L87 Difference]: Start difference. First operand 763 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:38,488 INFO L93 Difference]: Finished difference Result 1985 states and 3107 transitions. [2025-03-03 16:20:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:38,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:38,493 INFO L225 Difference]: With dead ends: 1985 [2025-03-03 16:20:38,493 INFO L226 Difference]: Without dead ends: 1242 [2025-03-03 16:20:38,495 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:38,495 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1111 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:38,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 3246 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-03-03 16:20:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1117. [2025-03-03 16:20:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1029 states have (on average 1.5413022351797863) internal successors, (1586), 1033 states have internal predecessors, (1586), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-03 16:20:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1722 transitions. [2025-03-03 16:20:38,529 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1722 transitions. Word has length 168 [2025-03-03 16:20:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:38,529 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1722 transitions. [2025-03-03 16:20:38,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1722 transitions. [2025-03-03 16:20:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:38,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:38,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:38,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:20:38,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:38,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1430950200, now seen corresponding path program 1 times [2025-03-03 16:20:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304501099] [2025-03-03 16:20:38,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:38,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:38,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:38,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:38,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:38,668 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,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304501099] [2025-03-03 16:20:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304501099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:38,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046961734] [2025-03-03 16:20:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:38,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:38,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:38,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:38,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:38,670 INFO L87 Difference]: Start difference. First operand 1117 states and 1722 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:39,341 INFO L93 Difference]: Finished difference Result 3111 states and 4860 transitions. [2025-03-03 16:20:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:39,348 INFO L225 Difference]: With dead ends: 3111 [2025-03-03 16:20:39,348 INFO L226 Difference]: Without dead ends: 2014 [2025-03-03 16:20:39,350 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:39,350 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 1106 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:39,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 3230 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-03-03 16:20:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1870. [2025-03-03 16:20:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1726 states have (on average 1.545191193511008) internal successors, (2667), 1734 states have internal predecessors, (2667), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-03 16:20:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2895 transitions. [2025-03-03 16:20:39,408 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2895 transitions. Word has length 168 [2025-03-03 16:20:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:39,408 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2895 transitions. [2025-03-03 16:20:39,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2895 transitions. [2025-03-03 16:20:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:39,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:39,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:39,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:20:39,410 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:39,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1600093975, now seen corresponding path program 1 times [2025-03-03 16:20:39,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:39,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593384050] [2025-03-03 16:20:39,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:39,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:39,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:39,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:39,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:39,552 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:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593384050] [2025-03-03 16:20:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593384050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639657756] [2025-03-03 16:20:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:39,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:39,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:39,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:39,554 INFO L87 Difference]: Start difference. First operand 1870 states and 2895 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:40,249 INFO L93 Difference]: Finished difference Result 5538 states and 8719 transitions. [2025-03-03 16:20:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:40,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:40,262 INFO L225 Difference]: With dead ends: 5538 [2025-03-03 16:20:40,263 INFO L226 Difference]: Without dead ends: 3688 [2025-03-03 16:20:40,267 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:40,268 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1101 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:40,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3218 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-03-03 16:20:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3505. [2025-03-03 16:20:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3243 states have (on average 1.5624421831637372) internal successors, (5067), 3265 states have internal predecessors, (5067), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-03 16:20:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 5503 transitions. [2025-03-03 16:20:40,401 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 5503 transitions. Word has length 168 [2025-03-03 16:20:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:40,401 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 5503 transitions. [2025-03-03 16:20:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 5503 transitions. [2025-03-03 16:20:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:40,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:40,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:40,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:20:40,404 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:40,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash -334112424, now seen corresponding path program 1 times [2025-03-03 16:20:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218073091] [2025-03-03 16:20:40,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:40,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:40,545 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:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218073091] [2025-03-03 16:20:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218073091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164469064] [2025-03-03 16:20:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:40,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:40,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:40,547 INFO L87 Difference]: Start difference. First operand 3505 states and 5503 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:41,303 INFO L93 Difference]: Finished difference Result 10889 states and 17473 transitions. [2025-03-03 16:20:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:41,332 INFO L225 Difference]: With dead ends: 10889 [2025-03-03 16:20:41,332 INFO L226 Difference]: Without dead ends: 7404 [2025-03-03 16:20:41,339 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:41,339 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1096 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:41,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 3206 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2025-03-03 16:20:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 7144. [2025-03-03 16:20:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5912794206397103) internal successors, (10547), 6696 states have internal predecessors, (10547), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-03 16:20:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11495 transitions. [2025-03-03 16:20:41,591 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11495 transitions. Word has length 168 [2025-03-03 16:20:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11495 transitions. [2025-03-03 16:20:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11495 transitions. [2025-03-03 16:20:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:41,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:41,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:41,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:20:41,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:41,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1543156471, now seen corresponding path program 1 times [2025-03-03 16:20:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:41,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22835077] [2025-03-03 16:20:41,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:41,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:41,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:41,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:41,696 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:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22835077] [2025-03-03 16:20:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22835077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:41,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:41,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141891177] [2025-03-03 16:20:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:41,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:41,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:41,698 INFO L87 Difference]: Start difference. First operand 7144 states and 11495 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:42,301 INFO L93 Difference]: Finished difference Result 15928 states and 26320 transitions. [2025-03-03 16:20:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:42,336 INFO L225 Difference]: With dead ends: 15928 [2025-03-03 16:20:42,337 INFO L226 Difference]: Without dead ends: 8804 [2025-03-03 16:20:42,357 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:42,357 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 787 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:42,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1189 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:20:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8804 states. [2025-03-03 16:20:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8804 to 7144. [2025-03-03 16:20:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.588714544357272) internal successors, (10530), 6696 states have internal predecessors, (10530), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-03 16:20:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11478 transitions. [2025-03-03 16:20:42,605 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11478 transitions. Word has length 168 [2025-03-03 16:20:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,605 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11478 transitions. [2025-03-03 16:20:42,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11478 transitions. [2025-03-03 16:20:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:42,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:20:42,612 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1465166200, now seen corresponding path program 1 times [2025-03-03 16:20:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34016401] [2025-03-03 16:20:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:42,708 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:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34016401] [2025-03-03 16:20:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34016401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110525678] [2025-03-03 16:20:42,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:42,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:42,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:42,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:42,711 INFO L87 Difference]: Start difference. First operand 7144 states and 11478 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:43,137 INFO L93 Difference]: Finished difference Result 15762 states and 25954 transitions. [2025-03-03 16:20:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:43,174 INFO L225 Difference]: With dead ends: 15762 [2025-03-03 16:20:43,174 INFO L226 Difference]: Without dead ends: 8638 [2025-03-03 16:20:43,194 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:43,195 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 783 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:43,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1175 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2025-03-03 16:20:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 7144. [2025-03-03 16:20:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.586149668074834) internal successors, (10513), 6696 states have internal predecessors, (10513), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-03 16:20:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11461 transitions. [2025-03-03 16:20:43,474 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11461 transitions. Word has length 168 [2025-03-03 16:20:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:43,475 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11461 transitions. [2025-03-03 16:20:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11461 transitions. [2025-03-03 16:20:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:43,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:43,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:43,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:20:43,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:43,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 571231289, now seen corresponding path program 1 times [2025-03-03 16:20:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670924218] [2025-03-03 16:20:43,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:43,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:43,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:43,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:43,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:43,640 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:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670924218] [2025-03-03 16:20:43,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670924218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:43,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158718808] [2025-03-03 16:20:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:43,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:43,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:43,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:43,644 INFO L87 Difference]: Start difference. First operand 7144 states and 11461 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:44,784 INFO L93 Difference]: Finished difference Result 22708 states and 37365 transitions. [2025-03-03 16:20:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:44,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:44,827 INFO L225 Difference]: With dead ends: 22708 [2025-03-03 16:20:44,827 INFO L226 Difference]: Without dead ends: 15584 [2025-03-03 16:20:44,842 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:44,842 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1072 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:44,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 3142 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2025-03-03 16:20:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 15232. [2025-03-03 16:20:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6172813338985446) internal successors, (22891), 14368 states have internal predecessors, (22891), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-03 16:20:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25247 transitions. [2025-03-03 16:20:45,343 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25247 transitions. Word has length 168 [2025-03-03 16:20:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25247 transitions. [2025-03-03 16:20:45,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25247 transitions. [2025-03-03 16:20:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:45,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:45,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:20:45,350 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1650773336, now seen corresponding path program 1 times [2025-03-03 16:20:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:45,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141056488] [2025-03-03 16:20:45,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:45,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:45,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:45,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:45,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:45,438 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:45,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:45,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141056488] [2025-03-03 16:20:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141056488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:45,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964556045] [2025-03-03 16:20:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:45,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:45,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:45,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:45,440 INFO L87 Difference]: Start difference. First operand 15232 states and 25247 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:46,117 INFO L93 Difference]: Finished difference Result 34364 states and 58658 transitions. [2025-03-03 16:20:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:46,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:46,182 INFO L225 Difference]: With dead ends: 34364 [2025-03-03 16:20:46,182 INFO L226 Difference]: Without dead ends: 19152 [2025-03-03 16:20:46,217 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:46,217 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 779 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:46,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1161 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19152 states. [2025-03-03 16:20:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19152 to 15232. [2025-03-03 16:20:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6149498375017663) internal successors, (22858), 14368 states have internal predecessors, (22858), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-03 16:20:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25214 transitions. [2025-03-03 16:20:47,042 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25214 transitions. Word has length 168 [2025-03-03 16:20:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:47,043 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25214 transitions. [2025-03-03 16:20:47,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25214 transitions. [2025-03-03 16:20:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:47,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:47,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:47,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:20:47,050 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1685597273, now seen corresponding path program 1 times [2025-03-03 16:20:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569826739] [2025-03-03 16:20:47,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:47,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:47,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:47,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:47,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:47,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569826739] [2025-03-03 16:20:47,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569826739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:47,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:47,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977983582] [2025-03-03 16:20:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:47,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:47,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:47,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:47,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:47,190 INFO L87 Difference]: Start difference. First operand 15232 states and 25214 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:48,661 INFO L93 Difference]: Finished difference Result 49442 states and 84598 transitions. [2025-03-03 16:20:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:48,785 INFO L225 Difference]: With dead ends: 49442 [2025-03-03 16:20:48,785 INFO L226 Difference]: Without dead ends: 34230 [2025-03-03 16:20:48,830 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:48,832 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1059 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:48,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 3111 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34230 states. [2025-03-03 16:20:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34230 to 33676. [2025-03-03 16:20:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33676 states, 31312 states have (on average 1.648441492079714) internal successors, (51616), 31980 states have internal predecessors, (51616), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-03-03 16:20:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33676 states to 33676 states and 58324 transitions. [2025-03-03 16:20:50,089 INFO L78 Accepts]: Start accepts. Automaton has 33676 states and 58324 transitions. Word has length 168 [2025-03-03 16:20:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:50,089 INFO L471 AbstractCegarLoop]: Abstraction has 33676 states and 58324 transitions. [2025-03-03 16:20:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 33676 states and 58324 transitions. [2025-03-03 16:20:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:50,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:50,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:20:50,101 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash -252942024, now seen corresponding path program 1 times [2025-03-03 16:20:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493194166] [2025-03-03 16:20:50,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:50,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:50,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:50,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:50,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:50,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493194166] [2025-03-03 16:20:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493194166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696748562] [2025-03-03 16:20:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:50,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:50,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:50,211 INFO L87 Difference]: Start difference. First operand 33676 states and 58324 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:53,646 INFO L93 Difference]: Finished difference Result 111748 states and 202530 transitions. [2025-03-03 16:20:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:20:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:53,953 INFO L225 Difference]: With dead ends: 111748 [2025-03-03 16:20:53,953 INFO L226 Difference]: Without dead ends: 78092 [2025-03-03 16:20:54,054 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:54,058 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1054 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:54,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 3099 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78092 states. [2025-03-03 16:20:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78092 to 77125. [2025-03-03 16:20:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77125 states, 71703 states have (on average 1.684225206755645) internal successors, (120764), 73765 states have internal predecessors, (120764), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-03-03 16:20:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77125 states to 77125 states and 142320 transitions. [2025-03-03 16:20:57,093 INFO L78 Accepts]: Start accepts. Automaton has 77125 states and 142320 transitions. Word has length 168 [2025-03-03 16:20:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:57,093 INFO L471 AbstractCegarLoop]: Abstraction has 77125 states and 142320 transitions. [2025-03-03 16:20:57,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 77125 states and 142320 transitions. [2025-03-03 16:20:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 16:20:57,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:57,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:57,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:20:57,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:57,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1700948871, now seen corresponding path program 1 times [2025-03-03 16:20:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90824561] [2025-03-03 16:20:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:57,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 16:20:57,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 16:20:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:57,217 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:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90824561] [2025-03-03 16:20:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90824561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761813289] [2025-03-03 16:20:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:57,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:57,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:57,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:57,219 INFO L87 Difference]: Start difference. First operand 77125 states and 142320 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:21:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:04,638 INFO L93 Difference]: Finished difference Result 271581 states and 528765 transitions. [2025-03-03 16:21:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2025-03-03 16:21:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:05,615 INFO L225 Difference]: With dead ends: 271581 [2025-03-03 16:21:05,615 INFO L226 Difference]: Without dead ends: 194476 [2025-03-03 16:21:05,933 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:21:05,933 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1162 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:05,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 3074 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:21:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194476 states.