./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.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_2.cil-1+token_ring.10.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 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:22:07,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:22:07,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:22:07,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:22:07,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:22:07,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:22:07,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:22:07,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:22:07,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:22:07,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:22:07,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:22:07,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:22:07,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:22:07,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:22:07,591 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:22:07,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:22:07,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:22:07,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:07,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:22:07,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:22:07,593 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 -> 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f [2025-03-03 16:22:07,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:22:07,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:22:07,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:22:07,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:22:07,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:22:07,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-03-03 16:22:08,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abbe90650/4ec2eb212c4e4291899e7bee3a10b228/FLAGae0afda33 [2025-03-03 16:22:09,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:22:09,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-03-03 16:22:09,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abbe90650/4ec2eb212c4e4291899e7bee3a10b228/FLAGae0afda33 [2025-03-03 16:22:09,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abbe90650/4ec2eb212c4e4291899e7bee3a10b228 [2025-03-03 16:22:09,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:22:09,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:22:09,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:09,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:22:09,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:22:09,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09, skipping insertion in model container [2025-03-03 16:22:09,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:22:09,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c[914,927] [2025-03-03 16:22:09,667 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_2.cil-1+token_ring.10.cil-1.c[7115,7128] [2025-03-03 16:22:09,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:09,779 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:22:09,788 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_2.cil-1+token_ring.10.cil-1.c[914,927] [2025-03-03 16:22:09,801 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_2.cil-1+token_ring.10.cil-1.c[7115,7128] [2025-03-03 16:22:09,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:09,858 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:22:09,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09 WrapperNode [2025-03-03 16:22:09,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:09,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:09,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:22:09,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:22:09,864 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:22:09" (1/1) ... [2025-03-03 16:22:09,879 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:22:09" (1/1) ... [2025-03-03 16:22:09,915 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 903 [2025-03-03 16:22:09,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:09,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:22:09,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:22:09,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:22:09,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,952 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:22:09,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:22:09,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:22:09,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:22:09,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:22:09,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (1/1) ... [2025-03-03 16:22:09,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:09,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:10,011 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:22:10,015 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:22:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:22:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:22:10,034 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:22:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:22:10,035 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:22:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:22:10,035 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:22:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:22:10,035 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:22:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:22:10,036 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:22:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:22:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:22:10,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:22:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:22:10,037 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:22:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:22:10,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:22:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:22:10,038 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:22:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:22:10,038 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:22:10,135 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:22:10,137 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:22:10,929 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-03 16:22:10,930 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:22:10,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:22:10,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:22:10,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:10 BoogieIcfgContainer [2025-03-03 16:22:10,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:22:10,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:22:10,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:22:10,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:22:10,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:22:09" (1/3) ... [2025-03-03 16:22:10,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb5042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:10, skipping insertion in model container [2025-03-03 16:22:10,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:09" (2/3) ... [2025-03-03 16:22:10,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb5042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:10, skipping insertion in model container [2025-03-03 16:22:10,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:10" (3/3) ... [2025-03-03 16:22:10,955 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-03-03 16:22:10,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:22:10,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c that has 16 procedures, 465 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-03-03 16:22:11,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:22:11,018 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;@7208b24c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:22:11,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:22:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 465 states, 407 states have (on average 1.5577395577395576) internal successors, (634), 415 states have internal predecessors, (634), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 16:22:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:11,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:11,029 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] [2025-03-03 16:22:11,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:11,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1734428172, now seen corresponding path program 1 times [2025-03-03 16:22:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-03-03 16:22:11,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:11,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:11,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:11,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:11,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:11,250 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:22:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-03-03 16:22:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218654963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496456526] [2025-03-03 16:22:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:11,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:11,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:11,270 INFO L87 Difference]: Start difference. First operand has 465 states, 407 states have (on average 1.5577395577395576) internal successors, (634), 415 states have internal predecessors, (634), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:11,365 INFO L93 Difference]: Finished difference Result 904 states and 1385 transitions. [2025-03-03 16:22:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:11,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:11,395 INFO L225 Difference]: With dead ends: 904 [2025-03-03 16:22:11,395 INFO L226 Difference]: Without dead ends: 454 [2025-03-03 16:22:11,398 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:22:11,402 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 133 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1239 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:22:11,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1239 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-03 16:22:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-03-03 16:22:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 399 states have (on average 1.5137844611528821) internal successors, (604), 404 states have internal predecessors, (604), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 16:22:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 680 transitions. [2025-03-03 16:22:11,455 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 680 transitions. Word has length 65 [2025-03-03 16:22:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:11,456 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 680 transitions. [2025-03-03 16:22:11,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 680 transitions. [2025-03-03 16:22:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:11,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:11,458 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] [2025-03-03 16:22:11,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:22:11,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1714090797, now seen corresponding path program 1 times [2025-03-03 16:22:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776352437] [2025-03-03 16:22:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:11,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:11,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:11,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:11,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:11,664 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:22:11,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776352437] [2025-03-03 16:22:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776352437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:11,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744653609] [2025-03-03 16:22:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:11,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:11,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:11,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:11,669 INFO L87 Difference]: Start difference. First operand 454 states and 680 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:12,379 INFO L93 Difference]: Finished difference Result 649 states and 952 transitions. [2025-03-03 16:22:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:12,387 INFO L225 Difference]: With dead ends: 649 [2025-03-03 16:22:12,387 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 16:22:12,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:22:12,388 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 437 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:12,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1478 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 16:22:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 552. [2025-03-03 16:22:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 477 states have (on average 1.4884696016771488) internal successors, (710), 484 states have internal predecessors, (710), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2025-03-03 16:22:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 813 transitions. [2025-03-03 16:22:12,414 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 813 transitions. Word has length 65 [2025-03-03 16:22:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:12,414 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 813 transitions. [2025-03-03 16:22:12,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 813 transitions. [2025-03-03 16:22:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:12,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:12,416 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] [2025-03-03 16:22:12,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:22:12,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:12,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 278750826, now seen corresponding path program 1 times [2025-03-03 16:22:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:12,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441754396] [2025-03-03 16:22:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:12,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:12,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:12,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:12,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:12,553 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:22:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441754396] [2025-03-03 16:22:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441754396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:12,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205715430] [2025-03-03 16:22:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:12,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:12,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:12,555 INFO L87 Difference]: Start difference. First operand 552 states and 813 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:13,280 INFO L93 Difference]: Finished difference Result 875 states and 1249 transitions. [2025-03-03 16:22:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:13,285 INFO L225 Difference]: With dead ends: 875 [2025-03-03 16:22:13,285 INFO L226 Difference]: Without dead ends: 694 [2025-03-03 16:22:13,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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:22:13,289 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 993 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:13,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1713 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-03 16:22:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 650. [2025-03-03 16:22:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 555 states have (on average 1.4684684684684686) internal successors, (815), 564 states have internal predecessors, (815), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2025-03-03 16:22:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 948 transitions. [2025-03-03 16:22:13,339 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 948 transitions. Word has length 65 [2025-03-03 16:22:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:13,340 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 948 transitions. [2025-03-03 16:22:13,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 948 transitions. [2025-03-03 16:22:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:13,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:13,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:22:13,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1411941419, now seen corresponding path program 1 times [2025-03-03 16:22:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317678182] [2025-03-03 16:22:13,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:13,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:13,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:13,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:13,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:13,428 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:22:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:13,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317678182] [2025-03-03 16:22:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317678182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:13,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:13,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296598057] [2025-03-03 16:22:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:13,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:13,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:13,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:13,431 INFO L87 Difference]: Start difference. First operand 650 states and 948 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:13,488 INFO L93 Difference]: Finished difference Result 928 states and 1327 transitions. [2025-03-03 16:22:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 16:22:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:13,492 INFO L225 Difference]: With dead ends: 928 [2025-03-03 16:22:13,492 INFO L226 Difference]: Without dead ends: 655 [2025-03-03 16:22:13,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:22:13,493 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:13,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-03 16:22:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-03-03 16:22:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 559 states have (on average 1.4615384615384615) internal successors, (817), 568 states have internal predecessors, (817), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2025-03-03 16:22:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 951 transitions. [2025-03-03 16:22:13,529 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 951 transitions. Word has length 65 [2025-03-03 16:22:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:13,529 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 951 transitions. [2025-03-03 16:22:13,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 951 transitions. [2025-03-03 16:22:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:13,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:13,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] [2025-03-03 16:22:13,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:22:13,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:13,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1250221878, now seen corresponding path program 1 times [2025-03-03 16:22:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:13,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462527859] [2025-03-03 16:22:13,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:13,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:13,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:13,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:13,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:13,618 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:22:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:13,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462527859] [2025-03-03 16:22:13,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462527859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:13,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:22:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522365399] [2025-03-03 16:22:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:13,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:22:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:13,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:22:13,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:22:13,621 INFO L87 Difference]: Start difference. First operand 655 states and 951 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:14,616 INFO L93 Difference]: Finished difference Result 1923 states and 2672 transitions. [2025-03-03 16:22:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-03 16:22:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:14,626 INFO L225 Difference]: With dead ends: 1923 [2025-03-03 16:22:14,627 INFO L226 Difference]: Without dead ends: 1627 [2025-03-03 16:22:14,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:22:14,628 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 2947 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2961 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:14,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2961 Valid, 1889 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:22:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2025-03-03 16:22:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1573. [2025-03-03 16:22:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1291 states have (on average 1.3749031758326877) internal successors, (1775), 1315 states have internal predecessors, (1775), 150 states have call successors, (150), 112 states have call predecessors, (150), 130 states have return successors, (186), 148 states have call predecessors, (186), 146 states have call successors, (186) [2025-03-03 16:22:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2111 transitions. [2025-03-03 16:22:14,714 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2111 transitions. Word has length 65 [2025-03-03 16:22:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:14,714 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2111 transitions. [2025-03-03 16:22:14,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2111 transitions. [2025-03-03 16:22:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:14,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:14,715 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] [2025-03-03 16:22:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:22:14,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1595483638, now seen corresponding path program 1 times [2025-03-03 16:22:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89254262] [2025-03-03 16:22:14,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:14,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:14,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:14,775 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:22:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89254262] [2025-03-03 16:22:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89254262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:14,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500230661] [2025-03-03 16:22:14,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:14,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:14,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:14,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:14,779 INFO L87 Difference]: Start difference. First operand 1573 states and 2111 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:14,854 INFO L93 Difference]: Finished difference Result 2811 states and 3712 transitions. [2025-03-03 16:22:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:22:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:14,862 INFO L225 Difference]: With dead ends: 2811 [2025-03-03 16:22:14,862 INFO L226 Difference]: Without dead ends: 1603 [2025-03-03 16:22:14,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:22:14,865 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:14,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-03 16:22:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-03 16:22:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1315 states have (on average 1.361977186311787) internal successors, (1791), 1339 states have internal predecessors, (1791), 150 states have call successors, (150), 112 states have call predecessors, (150), 136 states have return successors, (192), 154 states have call predecessors, (192), 146 states have call successors, (192) [2025-03-03 16:22:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2133 transitions. [2025-03-03 16:22:14,944 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2133 transitions. Word has length 66 [2025-03-03 16:22:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:14,944 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2133 transitions. [2025-03-03 16:22:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2133 transitions. [2025-03-03 16:22:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:14,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:14,946 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] [2025-03-03 16:22:14,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:22:14,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:14,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1584167511, now seen corresponding path program 1 times [2025-03-03 16:22:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113375405] [2025-03-03 16:22:14,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:14,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:14,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:14,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:14,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:15,074 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:22:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113375405] [2025-03-03 16:22:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113375405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:15,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294587754] [2025-03-03 16:22:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:15,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:15,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:15,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:15,075 INFO L87 Difference]: Start difference. First operand 1603 states and 2133 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:15,795 INFO L93 Difference]: Finished difference Result 2835 states and 3649 transitions. [2025-03-03 16:22:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:22:15,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 16:22:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:15,804 INFO L225 Difference]: With dead ends: 2835 [2025-03-03 16:22:15,804 INFO L226 Difference]: Without dead ends: 1825 [2025-03-03 16:22:15,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:22:15,807 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 978 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:15,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1496 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-03-03 16:22:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1544. [2025-03-03 16:22:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1272 states have (on average 1.3592767295597483) internal successors, (1729), 1291 states have internal predecessors, (1729), 144 states have call successors, (144), 107 states have call predecessors, (144), 126 states have return successors, (177), 147 states have call predecessors, (177), 140 states have call successors, (177) [2025-03-03 16:22:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2050 transitions. [2025-03-03 16:22:15,888 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2050 transitions. Word has length 66 [2025-03-03 16:22:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:15,889 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2050 transitions. [2025-03-03 16:22:15,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2050 transitions. [2025-03-03 16:22:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:15,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:15,890 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] [2025-03-03 16:22:15,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:22:15,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:15,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 633590442, now seen corresponding path program 1 times [2025-03-03 16:22:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600252920] [2025-03-03 16:22:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:15,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:15,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:15,941 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:22:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600252920] [2025-03-03 16:22:15,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600252920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:15,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:15,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:22:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672022155] [2025-03-03 16:22:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:15,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:22:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:15,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:22:15,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:22:15,944 INFO L87 Difference]: Start difference. First operand 1544 states and 2050 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:16,407 INFO L93 Difference]: Finished difference Result 3790 states and 4900 transitions. [2025-03-03 16:22:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:22:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 16:22:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:16,419 INFO L225 Difference]: With dead ends: 3790 [2025-03-03 16:22:16,420 INFO L226 Difference]: Without dead ends: 2612 [2025-03-03 16:22:16,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:16,423 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 936 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:16,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 766 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2025-03-03 16:22:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2608. [2025-03-03 16:22:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2096 states have (on average 1.299618320610687) internal successors, (2724), 2131 states have internal predecessors, (2724), 260 states have call successors, (260), 206 states have call predecessors, (260), 250 states have return successors, (365), 272 states have call predecessors, (365), 256 states have call successors, (365) [2025-03-03 16:22:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 3349 transitions. [2025-03-03 16:22:16,557 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 3349 transitions. Word has length 66 [2025-03-03 16:22:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 3349 transitions. [2025-03-03 16:22:16,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3349 transitions. [2025-03-03 16:22:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:22:16,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:16,558 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] [2025-03-03 16:22:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:22:16,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:16,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995998, now seen corresponding path program 1 times [2025-03-03 16:22:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25223622] [2025-03-03 16:22:16,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:16,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:22:16,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:22:16,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:16,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25223622] [2025-03-03 16:22:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25223622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73362640] [2025-03-03 16:22:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:16,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:16,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:16,585 INFO L87 Difference]: Start difference. First operand 2608 states and 3349 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:16,720 INFO L93 Difference]: Finished difference Result 5707 states and 7237 transitions. [2025-03-03 16:22:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:16,721 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 16:22:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:16,737 INFO L225 Difference]: With dead ends: 5707 [2025-03-03 16:22:16,737 INFO L226 Difference]: Without dead ends: 3465 [2025-03-03 16:22:16,742 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:22:16,745 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 102 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:16,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1342 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2025-03-03 16:22:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3385. [2025-03-03 16:22:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 2702 states have (on average 1.2838638045891932) internal successors, (3469), 2742 states have internal predecessors, (3469), 344 states have call successors, (344), 279 states have call predecessors, (344), 337 states have return successors, (469), 365 states have call predecessors, (469), 340 states have call successors, (469) [2025-03-03 16:22:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4282 transitions. [2025-03-03 16:22:16,914 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4282 transitions. Word has length 67 [2025-03-03 16:22:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:16,914 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 4282 transitions. [2025-03-03 16:22:16,914 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4282 transitions. [2025-03-03 16:22:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:22:16,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:16,916 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] [2025-03-03 16:22:16,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:22:16,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 163403966, now seen corresponding path program 1 times [2025-03-03 16:22:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355983046] [2025-03-03 16:22:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:16,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:22:16,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:22:16,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:16,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:16,948 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:22:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355983046] [2025-03-03 16:22:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355983046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256984410] [2025-03-03 16:22:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:16,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:16,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:16,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:16,949 INFO L87 Difference]: Start difference. First operand 3385 states and 4282 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:17,094 INFO L93 Difference]: Finished difference Result 6744 states and 8417 transitions. [2025-03-03 16:22:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:17,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-03 16:22:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:17,109 INFO L225 Difference]: With dead ends: 6744 [2025-03-03 16:22:17,110 INFO L226 Difference]: Without dead ends: 3724 [2025-03-03 16:22:17,115 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:22:17,116 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 644 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 813 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:22:17,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 813 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-03-03 16:22:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3663. [2025-03-03 16:22:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3663 states, 2923 states have (on average 1.2771125555935683) internal successors, (3733), 2965 states have internal predecessors, (3733), 372 states have call successors, (372), 304 states have call predecessors, (372), 366 states have return successors, (501), 395 states have call predecessors, (501), 368 states have call successors, (501) [2025-03-03 16:22:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 4606 transitions. [2025-03-03 16:22:17,318 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 4606 transitions. Word has length 73 [2025-03-03 16:22:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:17,319 INFO L471 AbstractCegarLoop]: Abstraction has 3663 states and 4606 transitions. [2025-03-03 16:22:17,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 4606 transitions. [2025-03-03 16:22:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:22:17,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:17,320 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:22:17,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1218240773, now seen corresponding path program 1 times [2025-03-03 16:22:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406577440] [2025-03-03 16:22:17,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:17,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:22:17,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:22:17,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:17,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406577440] [2025-03-03 16:22:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406577440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:22:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030017971] [2025-03-03 16:22:17,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:17,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:22:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:17,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:22:17,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:22:17,419 INFO L87 Difference]: Start difference. First operand 3663 states and 4606 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:17,833 INFO L93 Difference]: Finished difference Result 4462 states and 5574 transitions. [2025-03-03 16:22:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2025-03-03 16:22:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:17,848 INFO L225 Difference]: With dead ends: 4462 [2025-03-03 16:22:17,849 INFO L226 Difference]: Without dead ends: 4459 [2025-03-03 16:22:17,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:17,850 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1255 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:17,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 796 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:22:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2025-03-03 16:22:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4125. [2025-03-03 16:22:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 3278 states have (on average 1.2666259914582063) internal successors, (4152), 3323 states have internal predecessors, (4152), 422 states have call successors, (422), 348 states have call predecessors, (422), 423 states have return successors, (578), 455 states have call predecessors, (578), 419 states have call successors, (578) [2025-03-03 16:22:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5152 transitions. [2025-03-03 16:22:18,057 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5152 transitions. Word has length 75 [2025-03-03 16:22:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:18,057 INFO L471 AbstractCegarLoop]: Abstraction has 4125 states and 5152 transitions. [2025-03-03 16:22:18,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5152 transitions. [2025-03-03 16:22:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:22:18,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:18,059 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:18,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:22:18,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 888673023, now seen corresponding path program 1 times [2025-03-03 16:22:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515052070] [2025-03-03 16:22:18,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:18,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:22:18,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:22:18,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515052070] [2025-03-03 16:22:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515052070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333685139] [2025-03-03 16:22:18,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:18,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:18,150 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:22:18,151 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:22:18,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:22:18,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:22:18,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:18,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:18,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:22:18,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:18,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:22:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:18,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333685139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:22:18,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:22:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-03 16:22:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510970642] [2025-03-03 16:22:18,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:22:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:22:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:18,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:22:18,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:18,551 INFO L87 Difference]: Start difference. First operand 4125 states and 5152 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:22:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:19,076 INFO L93 Difference]: Finished difference Result 7976 states and 9829 transitions. [2025-03-03 16:22:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:22:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 76 [2025-03-03 16:22:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:19,107 INFO L225 Difference]: With dead ends: 7976 [2025-03-03 16:22:19,107 INFO L226 Difference]: Without dead ends: 7973 [2025-03-03 16:22:19,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:19,110 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 1558 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:19,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 3093 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:22:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2025-03-03 16:22:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 7568. [2025-03-03 16:22:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7568 states, 5979 states have (on average 1.2478675363773206) internal successors, (7461), 6059 states have internal predecessors, (7461), 781 states have call successors, (781), 662 states have call predecessors, (781), 806 states have return successors, (1079), 848 states have call predecessors, (1079), 778 states have call successors, (1079) [2025-03-03 16:22:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7568 states to 7568 states and 9321 transitions. [2025-03-03 16:22:19,696 INFO L78 Accepts]: Start accepts. Automaton has 7568 states and 9321 transitions. Word has length 76 [2025-03-03 16:22:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:19,696 INFO L471 AbstractCegarLoop]: Abstraction has 7568 states and 9321 transitions. [2025-03-03 16:22:19,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:22:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7568 states and 9321 transitions. [2025-03-03 16:22:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:22:19,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:19,698 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:19,704 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:22:19,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 16:22:19,898 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:19,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:19,899 INFO L85 PathProgramCache]: Analyzing trace with hash 57816793, now seen corresponding path program 2 times [2025-03-03 16:22:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732975048] [2025-03-03 16:22:19,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:22:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:19,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-03 16:22:19,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:22:19,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 16:22:19,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:19,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732975048] [2025-03-03 16:22:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732975048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:19,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:19,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657646814] [2025-03-03 16:22:19,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:19,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:19,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:19,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:19,937 INFO L87 Difference]: Start difference. First operand 7568 states and 9321 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:20,133 INFO L93 Difference]: Finished difference Result 9993 states and 12344 transitions. [2025-03-03 16:22:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-03-03 16:22:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:20,149 INFO L225 Difference]: With dead ends: 9993 [2025-03-03 16:22:20,149 INFO L226 Difference]: Without dead ends: 3769 [2025-03-03 16:22:20,159 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:22:20,160 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 649 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:20,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 867 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2025-03-03 16:22:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2966. [2025-03-03 16:22:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2381 states have (on average 1.261234775304494) internal successors, (3003), 2407 states have internal predecessors, (3003), 301 states have call successors, (301), 245 states have call predecessors, (301), 282 states have return successors, (380), 315 states have call predecessors, (380), 298 states have call successors, (380) [2025-03-03 16:22:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 3684 transitions. [2025-03-03 16:22:20,316 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 3684 transitions. Word has length 79 [2025-03-03 16:22:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 2966 states and 3684 transitions. [2025-03-03 16:22:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 3684 transitions. [2025-03-03 16:22:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 16:22:20,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:20,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:22:20,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -39163064, now seen corresponding path program 1 times [2025-03-03 16:22:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215708833] [2025-03-03 16:22:20,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:20,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 16:22:20,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 16:22:20,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:20,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:20,393 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:22:20,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215708833] [2025-03-03 16:22:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215708833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:20,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:20,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509623382] [2025-03-03 16:22:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:20,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:20,395 INFO L87 Difference]: Start difference. First operand 2966 states and 3684 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:21,408 INFO L93 Difference]: Finished difference Result 8147 states and 9944 transitions. [2025-03-03 16:22:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:22:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-03-03 16:22:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:21,433 INFO L225 Difference]: With dead ends: 8147 [2025-03-03 16:22:21,434 INFO L226 Difference]: Without dead ends: 4823 [2025-03-03 16:22:21,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:22:21,440 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 821 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:21,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1914 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2025-03-03 16:22:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4631. [2025-03-03 16:22:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 3663 states have (on average 1.2260442260442261) internal successors, (4491), 3720 states have internal predecessors, (4491), 482 states have call successors, (482), 404 states have call predecessors, (482), 484 states have return successors, (673), 508 states have call predecessors, (673), 479 states have call successors, (673) [2025-03-03 16:22:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 5646 transitions. [2025-03-03 16:22:21,707 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 5646 transitions. Word has length 85 [2025-03-03 16:22:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:21,708 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 5646 transitions. [2025-03-03 16:22:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 5646 transitions. [2025-03-03 16:22:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:22:21,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:21,710 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:21,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:22:21,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:21,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash -554567797, now seen corresponding path program 1 times [2025-03-03 16:22:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032156752] [2025-03-03 16:22:21,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:21,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:22:21,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:22:21,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:21,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:22:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032156752] [2025-03-03 16:22:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032156752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:21,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:21,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:22:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749812701] [2025-03-03 16:22:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:21,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:22:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:21,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:22:21,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:21,797 INFO L87 Difference]: Start difference. First operand 4631 states and 5646 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:22,788 INFO L93 Difference]: Finished difference Result 7493 states and 9111 transitions. [2025-03-03 16:22:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-03 16:22:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:22,805 INFO L225 Difference]: With dead ends: 7493 [2025-03-03 16:22:22,806 INFO L226 Difference]: Without dead ends: 3752 [2025-03-03 16:22:22,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:22:22,813 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 1601 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:22,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 1990 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2025-03-03 16:22:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3412. [2025-03-03 16:22:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 2702 states have (on average 1.2224278312361214) internal successors, (3303), 2746 states have internal predecessors, (3303), 351 states have call successors, (351), 287 states have call predecessors, (351), 357 states have return successors, (468), 380 states have call predecessors, (468), 348 states have call successors, (468) [2025-03-03 16:22:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4122 transitions. [2025-03-03 16:22:23,156 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4122 transitions. Word has length 95 [2025-03-03 16:22:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:23,157 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 4122 transitions. [2025-03-03 16:22:23,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4122 transitions. [2025-03-03 16:22:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 16:22:23,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:23,162 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:22:23,162 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash -776985087, now seen corresponding path program 1 times [2025-03-03 16:22:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:23,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318925977] [2025-03-03 16:22:23,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:23,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 16:22:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 16:22:23,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 16:22:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318925977] [2025-03-03 16:22:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318925977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863352862] [2025-03-03 16:22:23,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:23,316 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:22:23,318 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:22:23,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 16:22:23,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 16:22:23,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:23,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:23,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 16:22:23,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 16:22:23,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:22:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863352862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:23,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:22:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 16:22:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766534127] [2025-03-03 16:22:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:23,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:23,481 INFO L87 Difference]: Start difference. First operand 3412 states and 4122 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:22:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:23,595 INFO L93 Difference]: Finished difference Result 4850 states and 5828 transitions. [2025-03-03 16:22:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-03-03 16:22:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:23,603 INFO L225 Difference]: With dead ends: 4850 [2025-03-03 16:22:23,603 INFO L226 Difference]: Without dead ends: 1804 [2025-03-03 16:22:23,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:23,607 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 0 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3361 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:23,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3361 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-03-03 16:22:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2025-03-03 16:22:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1503 states have (on average 1.2521623419827013) internal successors, (1882), 1518 states have internal predecessors, (1882), 154 states have call successors, (154), 111 states have call predecessors, (154), 145 states have return successors, (205), 175 states have call predecessors, (205), 151 states have call successors, (205) [2025-03-03 16:22:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2241 transitions. [2025-03-03 16:22:23,682 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2241 transitions. Word has length 146 [2025-03-03 16:22:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:23,682 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2241 transitions. [2025-03-03 16:22:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:22:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2241 transitions. [2025-03-03 16:22:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 16:22:23,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:23,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:23,691 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:22:23,885 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,SelfDestructingSolverStorable15 [2025-03-03 16:22:23,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:23,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 221420876, now seen corresponding path program 1 times [2025-03-03 16:22:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892827097] [2025-03-03 16:22:23,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:23,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 16:22:23,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 16:22:23,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 16:22:23,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:23,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892827097] [2025-03-03 16:22:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892827097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:23,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079551566] [2025-03-03 16:22:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:23,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:23,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:23,947 INFO L87 Difference]: Start difference. First operand 1804 states and 2241 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 16:22:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:24,497 INFO L93 Difference]: Finished difference Result 3083 states and 3752 transitions. [2025-03-03 16:22:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 161 [2025-03-03 16:22:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:24,505 INFO L225 Difference]: With dead ends: 3083 [2025-03-03 16:22:24,505 INFO L226 Difference]: Without dead ends: 1742 [2025-03-03 16:22:24,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:24,507 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 326 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:24,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1480 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-03-03 16:22:24,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1657. [2025-03-03 16:22:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1384 states have (on average 1.2651734104046244) internal successors, (1751), 1398 states have internal predecessors, (1751), 140 states have call successors, (140), 99 states have call predecessors, (140), 131 states have return successors, (185), 160 states have call predecessors, (185), 137 states have call successors, (185) [2025-03-03 16:22:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2076 transitions. [2025-03-03 16:22:24,581 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2076 transitions. Word has length 161 [2025-03-03 16:22:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2076 transitions. [2025-03-03 16:22:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 16:22:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2076 transitions. [2025-03-03 16:22:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:22:24,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:24,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:24,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:22:24,584 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:24,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash 821600324, now seen corresponding path program 1 times [2025-03-03 16:22:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:24,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018124422] [2025-03-03 16:22:24,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:24,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:22:24,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:22:24,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:24,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 16:22:24,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018124422] [2025-03-03 16:22:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018124422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587355746] [2025-03-03 16:22:24,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:24,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:24,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:24,779 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:22:24,781 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:22:24,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:22:24,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:22:24,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:24,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:24,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:22:24,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 16:22:25,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:22:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 16:22:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587355746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:22:25,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:22:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-03 16:22:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807798488] [2025-03-03 16:22:25,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:22:25,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 16:22:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:25,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 16:22:25,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:25,214 INFO L87 Difference]: Start difference. First operand 1657 states and 2076 transitions. Second operand has 13 states, 13 states have (on average 19.23076923076923) internal successors, (250), 13 states have internal predecessors, (250), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-03 16:22:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:26,268 INFO L93 Difference]: Finished difference Result 3498 states and 4341 transitions. [2025-03-03 16:22:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 16:22:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 19.23076923076923) internal successors, (250), 13 states have internal predecessors, (250), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 164 [2025-03-03 16:22:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:26,277 INFO L225 Difference]: With dead ends: 3498 [2025-03-03 16:22:26,277 INFO L226 Difference]: Without dead ends: 2139 [2025-03-03 16:22:26,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:22:26,281 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1672 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:26,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 2427 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:22:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-03 16:22:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1935. [2025-03-03 16:22:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1587 states have (on average 1.2312539382482672) internal successors, (1954), 1602 states have internal predecessors, (1954), 180 states have call successors, (180), 137 states have call predecessors, (180), 166 states have return successors, (254), 196 states have call predecessors, (254), 177 states have call successors, (254) [2025-03-03 16:22:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2388 transitions. [2025-03-03 16:22:26,380 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2388 transitions. Word has length 164 [2025-03-03 16:22:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:26,380 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 2388 transitions. [2025-03-03 16:22:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.23076923076923) internal successors, (250), 13 states have internal predecessors, (250), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-03 16:22:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2388 transitions. [2025-03-03 16:22:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:26,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:26,383 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] [2025-03-03 16:22:26,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:22:26,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:22:26,587 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1003251979, now seen corresponding path program 1 times [2025-03-03 16:22:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735907102] [2025-03-03 16:22:26,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:26,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:26,681 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:22:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735907102] [2025-03-03 16:22:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735907102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866356696] [2025-03-03 16:22:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:26,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:26,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:26,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:26,683 INFO L87 Difference]: Start difference. First operand 1935 states and 2388 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:22:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:27,227 INFO L93 Difference]: Finished difference Result 2651 states and 3502 transitions. [2025-03-03 16:22:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:27,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:27,234 INFO L225 Difference]: With dead ends: 2651 [2025-03-03 16:22:27,234 INFO L226 Difference]: Without dead ends: 2313 [2025-03-03 16:22:27,235 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:22:27,236 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1184 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:27,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1711 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2025-03-03 16:22:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2286. [2025-03-03 16:22:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1912 states have (on average 1.286610878661088) internal successors, (2460), 1928 states have internal predecessors, (2460), 199 states have call successors, (199), 143 states have call predecessors, (199), 173 states have return successors, (274), 215 states have call predecessors, (274), 196 states have call successors, (274) [2025-03-03 16:22:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 2933 transitions. [2025-03-03 16:22:27,334 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 2933 transitions. Word has length 157 [2025-03-03 16:22:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:27,334 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 2933 transitions. [2025-03-03 16:22:27,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:22:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2933 transitions. [2025-03-03 16:22:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:27,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:27,336 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] [2025-03-03 16:22:27,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:22:27,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:27,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -811214071, now seen corresponding path program 1 times [2025-03-03 16:22:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:27,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835722771] [2025-03-03 16:22:27,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:27,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:27,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:27,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:27,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:27,416 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:22:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835722771] [2025-03-03 16:22:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835722771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927143376] [2025-03-03 16:22:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:27,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:27,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:27,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:27,418 INFO L87 Difference]: Start difference. First operand 2286 states and 2933 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:28,158 INFO L93 Difference]: Finished difference Result 3418 states and 4713 transitions. [2025-03-03 16:22:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:28,167 INFO L225 Difference]: With dead ends: 3418 [2025-03-03 16:22:28,168 INFO L226 Difference]: Without dead ends: 2729 [2025-03-03 16:22:28,169 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:22:28,170 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 1189 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:28,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 3226 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2025-03-03 16:22:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2614. [2025-03-03 16:22:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2214 states have (on average 1.3188798554652212) internal successors, (2920), 2231 states have internal predecessors, (2920), 218 states have call successors, (218), 149 states have call predecessors, (218), 180 states have return successors, (296), 235 states have call predecessors, (296), 215 states have call successors, (296) [2025-03-03 16:22:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3434 transitions. [2025-03-03 16:22:28,315 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3434 transitions. Word has length 157 [2025-03-03 16:22:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 2614 states and 3434 transitions. [2025-03-03 16:22:28,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3434 transitions. [2025-03-03 16:22:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:28,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:28,318 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] [2025-03-03 16:22:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:22:28,319 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2035746378, now seen corresponding path program 1 times [2025-03-03 16:22:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:28,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645889054] [2025-03-03 16:22:28,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:28,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:28,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:28,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:28,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:28,394 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:22:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645889054] [2025-03-03 16:22:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645889054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599912306] [2025-03-03 16:22:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:28,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:28,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:28,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:28,396 INFO L87 Difference]: Start difference. First operand 2614 states and 3434 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:29,085 INFO L93 Difference]: Finished difference Result 4460 states and 6331 transitions. [2025-03-03 16:22:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:29,096 INFO L225 Difference]: With dead ends: 4460 [2025-03-03 16:22:29,096 INFO L226 Difference]: Without dead ends: 3443 [2025-03-03 16:22:29,099 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:22:29,099 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 1184 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:29,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 3210 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2025-03-03 16:22:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3311. [2025-03-03 16:22:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 2857 states have (on average 1.3703185159257962) internal successors, (3915), 2878 states have internal predecessors, (3915), 256 states have call successors, (256), 161 states have call predecessors, (256), 196 states have return successors, (346), 275 states have call predecessors, (346), 253 states have call successors, (346) [2025-03-03 16:22:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4517 transitions. [2025-03-03 16:22:29,251 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4517 transitions. Word has length 157 [2025-03-03 16:22:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:29,252 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 4517 transitions. [2025-03-03 16:22:29,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4517 transitions. [2025-03-03 16:22:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:29,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:29,255 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] [2025-03-03 16:22:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:22:29,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:29,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash -920457495, now seen corresponding path program 1 times [2025-03-03 16:22:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014628808] [2025-03-03 16:22:29,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:29,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:29,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:29,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:29,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:29,350 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:22:29,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014628808] [2025-03-03 16:22:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014628808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6127263] [2025-03-03 16:22:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:29,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:29,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:29,353 INFO L87 Difference]: Start difference. First operand 3311 states and 4517 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:30,028 INFO L93 Difference]: Finished difference Result 6703 states and 9888 transitions. [2025-03-03 16:22:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:30,046 INFO L225 Difference]: With dead ends: 6703 [2025-03-03 16:22:30,046 INFO L226 Difference]: Without dead ends: 4989 [2025-03-03 16:22:30,051 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:22:30,053 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1179 mSDsluCounter, 2405 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 3198 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:30,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 3198 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2025-03-03 16:22:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 4822. [2025-03-03 16:22:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4822 states, 4254 states have (on average 1.4384109073812883) internal successors, (6119), 4289 states have internal predecessors, (6119), 332 states have call successors, (332), 185 states have call predecessors, (332), 234 states have return successors, (470), 355 states have call predecessors, (470), 329 states have call successors, (470) [2025-03-03 16:22:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4822 states to 4822 states and 6921 transitions. [2025-03-03 16:22:30,254 INFO L78 Accepts]: Start accepts. Automaton has 4822 states and 6921 transitions. Word has length 157 [2025-03-03 16:22:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:30,255 INFO L471 AbstractCegarLoop]: Abstraction has 4822 states and 6921 transitions. [2025-03-03 16:22:30,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 6921 transitions. [2025-03-03 16:22:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:30,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:30,258 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] [2025-03-03 16:22:30,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:22:30,258 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:30,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash -738724246, now seen corresponding path program 1 times [2025-03-03 16:22:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:30,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33773017] [2025-03-03 16:22:30,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:30,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:30,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:30,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:30,344 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:22:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33773017] [2025-03-03 16:22:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33773017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383198325] [2025-03-03 16:22:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:30,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:30,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:30,346 INFO L87 Difference]: Start difference. First operand 4822 states and 6921 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:31,137 INFO L93 Difference]: Finished difference Result 11638 states and 17942 transitions. [2025-03-03 16:22:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:31,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:31,162 INFO L225 Difference]: With dead ends: 11638 [2025-03-03 16:22:31,162 INFO L226 Difference]: Without dead ends: 8413 [2025-03-03 16:22:31,172 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:22:31,173 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 1174 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:31,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 3186 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8413 states. [2025-03-03 16:22:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8413 to 8177. [2025-03-03 16:22:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 7363 states have (on average 1.51229118565802) internal successors, (11135), 7444 states have internal predecessors, (11135), 484 states have call successors, (484), 233 states have call predecessors, (484), 328 states have return successors, (814), 515 states have call predecessors, (814), 481 states have call successors, (814) [2025-03-03 16:22:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 12433 transitions. [2025-03-03 16:22:31,535 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 12433 transitions. Word has length 157 [2025-03-03 16:22:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:31,535 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 12433 transitions. [2025-03-03 16:22:31,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 12433 transitions. [2025-03-03 16:22:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:31,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:31,540 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] [2025-03-03 16:22:31,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:22:31,540 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:31,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -594314551, now seen corresponding path program 1 times [2025-03-03 16:22:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829959171] [2025-03-03 16:22:31,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:31,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:31,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:31,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:31,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:31,611 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:22:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829959171] [2025-03-03 16:22:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829959171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567226808] [2025-03-03 16:22:31,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:31,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:31,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:31,613 INFO L87 Difference]: Start difference. First operand 8177 states and 12433 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:32,226 INFO L93 Difference]: Finished difference Result 16251 states and 26025 transitions. [2025-03-03 16:22:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:32,261 INFO L225 Difference]: With dead ends: 16251 [2025-03-03 16:22:32,261 INFO L226 Difference]: Without dead ends: 9671 [2025-03-03 16:22:32,278 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:22:32,279 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 893 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:32,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1270 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2025-03-03 16:22:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 8177. [2025-03-03 16:22:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 7363 states have (on average 1.5099823441531983) internal successors, (11118), 7444 states have internal predecessors, (11118), 484 states have call successors, (484), 233 states have call predecessors, (484), 328 states have return successors, (814), 515 states have call predecessors, (814), 481 states have call successors, (814) [2025-03-03 16:22:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 12416 transitions. [2025-03-03 16:22:32,785 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 12416 transitions. Word has length 157 [2025-03-03 16:22:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:32,785 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 12416 transitions. [2025-03-03 16:22:32,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 12416 transitions. [2025-03-03 16:22:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:32,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:32,790 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] [2025-03-03 16:22:32,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:22:32,790 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:32,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash -866750838, now seen corresponding path program 1 times [2025-03-03 16:22:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:32,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540998268] [2025-03-03 16:22:32,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:32,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:32,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:32,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:32,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:32,856 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:22:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540998268] [2025-03-03 16:22:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540998268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:32,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388523339] [2025-03-03 16:22:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:32,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:32,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:32,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:32,858 INFO L87 Difference]: Start difference. First operand 8177 states and 12416 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:33,522 INFO L93 Difference]: Finished difference Result 16168 states and 25825 transitions. [2025-03-03 16:22:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:33,555 INFO L225 Difference]: With dead ends: 16168 [2025-03-03 16:22:33,555 INFO L226 Difference]: Without dead ends: 9588 [2025-03-03 16:22:33,567 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:22:33,567 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 890 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:33,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1262 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9588 states. [2025-03-03 16:22:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9588 to 8177. [2025-03-03 16:22:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 7363 states have (on average 1.507673502648377) internal successors, (11101), 7444 states have internal predecessors, (11101), 484 states have call successors, (484), 233 states have call predecessors, (484), 328 states have return successors, (814), 515 states have call predecessors, (814), 481 states have call successors, (814) [2025-03-03 16:22:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 12399 transitions. [2025-03-03 16:22:33,920 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 12399 transitions. Word has length 157 [2025-03-03 16:22:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:33,920 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 12399 transitions. [2025-03-03 16:22:33,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 12399 transitions. [2025-03-03 16:22:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:33,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:33,924 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] [2025-03-03 16:22:33,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:22:33,925 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1618312873, now seen corresponding path program 1 times [2025-03-03 16:22:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51817937] [2025-03-03 16:22:33,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:33,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:33,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:33,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:33,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:33,989 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:22:33,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:33,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51817937] [2025-03-03 16:22:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51817937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577700620] [2025-03-03 16:22:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:33,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:33,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:33,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:33,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:33,991 INFO L87 Difference]: Start difference. First operand 8177 states and 12399 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:34,602 INFO L93 Difference]: Finished difference Result 16085 states and 25625 transitions. [2025-03-03 16:22:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:34,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:34,630 INFO L225 Difference]: With dead ends: 16085 [2025-03-03 16:22:34,631 INFO L226 Difference]: Without dead ends: 9505 [2025-03-03 16:22:34,643 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:22:34,644 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 887 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:34,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1254 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9505 states. [2025-03-03 16:22:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9505 to 8177. [2025-03-03 16:22:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 7363 states have (on average 1.5053646611435556) internal successors, (11084), 7444 states have internal predecessors, (11084), 484 states have call successors, (484), 233 states have call predecessors, (484), 328 states have return successors, (814), 515 states have call predecessors, (814), 481 states have call successors, (814) [2025-03-03 16:22:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 12382 transitions. [2025-03-03 16:22:35,077 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 12382 transitions. Word has length 157 [2025-03-03 16:22:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:35,078 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 12382 transitions. [2025-03-03 16:22:35,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 12382 transitions. [2025-03-03 16:22:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:35,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:35,082 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] [2025-03-03 16:22:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 16:22:35,082 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1144286890, now seen corresponding path program 1 times [2025-03-03 16:22:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27284717] [2025-03-03 16:22:35,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:35,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:35,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:35,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:35,161 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:22:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:35,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27284717] [2025-03-03 16:22:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27284717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:35,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355797631] [2025-03-03 16:22:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:35,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:35,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:35,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:35,163 INFO L87 Difference]: Start difference. First operand 8177 states and 12382 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:36,309 INFO L93 Difference]: Finished difference Result 22481 states and 36095 transitions. [2025-03-03 16:22:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:36,354 INFO L225 Difference]: With dead ends: 22481 [2025-03-03 16:22:36,354 INFO L226 Difference]: Without dead ends: 15901 [2025-03-03 16:22:36,369 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:22:36,369 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1145 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:36,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 3117 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15901 states. [2025-03-03 16:22:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15901 to 15589. [2025-03-03 16:22:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15589 states, 14229 states have (on average 1.5673624288425048) internal successors, (22302), 14456 states have internal predecessors, (22302), 788 states have call successors, (788), 329 states have call predecessors, (788), 570 states have return successors, (1886), 835 states have call predecessors, (1886), 785 states have call successors, (1886) [2025-03-03 16:22:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15589 states to 15589 states and 24976 transitions. [2025-03-03 16:22:37,400 INFO L78 Accepts]: Start accepts. Automaton has 15589 states and 24976 transitions. Word has length 157 [2025-03-03 16:22:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 15589 states and 24976 transitions. [2025-03-03 16:22:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 15589 states and 24976 transitions. [2025-03-03 16:22:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:37,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:37,406 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] [2025-03-03 16:22:37,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 16:22:37,406 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash 851901065, now seen corresponding path program 1 times [2025-03-03 16:22:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192316505] [2025-03-03 16:22:37,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:37,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:37,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:37,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:37,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:37,460 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:22:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192316505] [2025-03-03 16:22:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192316505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871363468] [2025-03-03 16:22:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:37,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:37,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:37,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:37,462 INFO L87 Difference]: Start difference. First operand 15589 states and 24976 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:38,386 INFO L93 Difference]: Finished difference Result 33011 states and 55297 transitions. [2025-03-03 16:22:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:38,439 INFO L225 Difference]: With dead ends: 33011 [2025-03-03 16:22:38,439 INFO L226 Difference]: Without dead ends: 19019 [2025-03-03 16:22:38,469 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:22:38,470 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 883 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:38,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1240 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19019 states. [2025-03-03 16:22:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19019 to 15589. [2025-03-03 16:22:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15589 states, 14229 states have (on average 1.5650432215897112) internal successors, (22269), 14456 states have internal predecessors, (22269), 788 states have call successors, (788), 329 states have call predecessors, (788), 570 states have return successors, (1886), 835 states have call predecessors, (1886), 785 states have call successors, (1886) [2025-03-03 16:22:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15589 states to 15589 states and 24943 transitions. [2025-03-03 16:22:39,228 INFO L78 Accepts]: Start accepts. Automaton has 15589 states and 24943 transitions. Word has length 157 [2025-03-03 16:22:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:39,228 INFO L471 AbstractCegarLoop]: Abstraction has 15589 states and 24943 transitions. [2025-03-03 16:22:39,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:22:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15589 states and 24943 transitions. [2025-03-03 16:22:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:39,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:39,234 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] [2025-03-03 16:22:39,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 16:22:39,234 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:39,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1512835382, now seen corresponding path program 1 times [2025-03-03 16:22:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613500154] [2025-03-03 16:22:39,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:39,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:39,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:39,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:39,309 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:22:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613500154] [2025-03-03 16:22:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613500154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:39,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153867837] [2025-03-03 16:22:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:39,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:39,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:39,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:39,311 INFO L87 Difference]: Start difference. First operand 15589 states and 24943 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:40,816 INFO L93 Difference]: Finished difference Result 46831 states and 79040 transitions. [2025-03-03 16:22:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:40,901 INFO L225 Difference]: With dead ends: 46831 [2025-03-03 16:22:40,902 INFO L226 Difference]: Without dead ends: 32839 [2025-03-03 16:22:40,936 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:22:40,937 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1132 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:40,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 3086 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32839 states. [2025-03-03 16:22:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32839 to 32357. [2025-03-03 16:22:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32357 states, 29743 states have (on average 1.615808761725448) internal successors, (48059), 30424 states have internal predecessors, (48059), 1396 states have call successors, (1396), 521 states have call predecessors, (1396), 1216 states have return successors, (5566), 1475 states have call predecessors, (5566), 1393 states have call successors, (5566) [2025-03-03 16:22:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32357 states to 32357 states and 55021 transitions. [2025-03-03 16:22:42,704 INFO L78 Accepts]: Start accepts. Automaton has 32357 states and 55021 transitions. Word has length 157 [2025-03-03 16:22:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 32357 states and 55021 transitions. [2025-03-03 16:22:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32357 states and 55021 transitions. [2025-03-03 16:22:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:42,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:42,713 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] [2025-03-03 16:22:42,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 16:22:42,714 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:42,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1727664535, now seen corresponding path program 1 times [2025-03-03 16:22:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156872998] [2025-03-03 16:22:42,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:42,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:42,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:42,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:42,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:42,789 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:22:42,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:42,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156872998] [2025-03-03 16:22:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156872998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:42,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:42,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:42,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963820435] [2025-03-03 16:22:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:42,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:42,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:42,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:42,791 INFO L87 Difference]: Start difference. First operand 32357 states and 55021 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:45,695 INFO L93 Difference]: Finished difference Result 107873 states and 193165 transitions. [2025-03-03 16:22:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:45,943 INFO L225 Difference]: With dead ends: 107873 [2025-03-03 16:22:45,943 INFO L226 Difference]: Without dead ends: 77113 [2025-03-03 16:22:46,041 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:22:46,041 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1441 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:46,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 3061 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77113 states. [2025-03-03 16:22:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77113 to 71290. [2025-03-03 16:22:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71290 states, 65746 states have (on average 1.6609223374806072) internal successors, (109199), 67821 states have internal predecessors, (109199), 2548 states have call successors, (2548), 905 states have call predecessors, (2548), 2994 states have return successors, (19006), 2691 states have call predecessors, (19006), 2545 states have call successors, (19006) [2025-03-03 16:22:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71290 states to 71290 states and 130753 transitions. [2025-03-03 16:22:50,333 INFO L78 Accepts]: Start accepts. Automaton has 71290 states and 130753 transitions. Word has length 157 [2025-03-03 16:22:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:50,334 INFO L471 AbstractCegarLoop]: Abstraction has 71290 states and 130753 transitions. [2025-03-03 16:22:50,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 71290 states and 130753 transitions. [2025-03-03 16:22:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:22:50,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:50,351 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] [2025-03-03 16:22:50,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 16:22:50,352 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:50,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 66520810, now seen corresponding path program 1 times [2025-03-03 16:22:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004153437] [2025-03-03 16:22:50,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:50,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:22:50,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:22:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:50,419 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:22:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004153437] [2025-03-03 16:22:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004153437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38551989] [2025-03-03 16:22:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:50,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:50,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:50,421 INFO L87 Difference]: Start difference. First operand 71290 states and 130753 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:22:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:58,323 INFO L93 Difference]: Finished difference Result 244394 states and 478279 transitions. [2025-03-03 16:22:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:22:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:59,082 INFO L225 Difference]: With dead ends: 244394 [2025-03-03 16:22:59,082 INFO L226 Difference]: Without dead ends: 174701 [2025-03-03 16:22:59,333 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:22:59,333 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1405 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:59,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3045 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174701 states.