./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:12:53,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:12:54,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:12:54,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:12:54,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:12:54,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:12:54,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:12:54,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:12:54,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:12:54,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:12:54,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:12:54,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:12:54,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:12:54,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:12:54,089 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:12:54,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:12:54,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:12:54,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:12:54,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:12:54,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:12:54,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:12:54,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:12:54,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:12:54,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:12:54,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:12:54,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:12:54,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:12:54,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:12:54,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:12:54,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:12:54,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:12:54,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:12:54,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:12:54,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:12:54,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:12:54,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:12:54,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:12:54,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:12:54,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:12:54,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:12:54,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:12:54,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:12:54,098 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-14 05:12:54,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:12:54,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:12:54,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:12:54,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:12:54,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:12:54,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2024-10-14 05:12:55,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:12:56,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:12:56,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2024-10-14 05:12:56,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b7ca184b/3f50ae46a56244f99d6f2205309313b1/FLAG66906034d [2024-10-14 05:12:56,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b7ca184b/3f50ae46a56244f99d6f2205309313b1 [2024-10-14 05:12:56,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:12:56,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:12:56,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:12:56,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:12:56,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:12:56,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:56,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7975d30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56, skipping insertion in model container [2024-10-14 05:12:56,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:56,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:12:56,618 WARN L248 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] [2024-10-14 05:12:56,672 WARN L248 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] [2024-10-14 05:12:56,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:12:56,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:12:56,835 WARN L248 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] [2024-10-14 05:12:56,852 WARN L248 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] [2024-10-14 05:12:56,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:12:56,944 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:12:56,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56 WrapperNode [2024-10-14 05:12:56,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:12:56,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:12:56,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:12:56,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:12:56,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:56,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,008 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 954 [2024-10-14 05:12:57,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:12:57,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:12:57,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:12:57,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:12:57,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,060 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]. [2024-10-14 05:12:57,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:12:57,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:12:57,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:12:57,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:12:57,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (1/1) ... [2024-10-14 05:12:57,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:12:57,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:57,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:12:57,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:12:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:12:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:12:57,214 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:12:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:12:57,215 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:12:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:12:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:12:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:12:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:12:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:12:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:12:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:12:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:12:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:12:57,216 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:12:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:12:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:12:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:12:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:12:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:12:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:12:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:12:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:12:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:12:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:12:57,217 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:12:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:12:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:12:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:12:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:12:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:12:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:12:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:12:57,218 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:12:57,365 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:12:57,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:12:58,376 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-10-14 05:12:58,377 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:12:58,464 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:12:58,464 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-14 05:12:58,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:58 BoogieIcfgContainer [2024-10-14 05:12:58,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:12:58,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:12:58,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:12:58,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:12:58,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:12:56" (1/3) ... [2024-10-14 05:12:58,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1569a9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:58, skipping insertion in model container [2024-10-14 05:12:58,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:56" (2/3) ... [2024-10-14 05:12:58,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1569a9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:58, skipping insertion in model container [2024-10-14 05:12:58,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:58" (3/3) ... [2024-10-14 05:12:58,474 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2024-10-14 05:12:58,491 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:12:58,491 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:12:58,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:12:58,613 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;@20b1d060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:12:58,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:12:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 343 states have (on average 1.7113702623906706) internal successors, (587), 351 states have internal predecessors, (587), 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) [2024-10-14 05:12:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:12:58,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:58,634 INFO L215 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] [2024-10-14 05:12:58,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1105280806, now seen corresponding path program 1 times [2024-10-14 05:12:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719810558] [2024-10-14 05:12:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:12:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719810558] [2024-10-14 05:12:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719810558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569760249] [2024-10-14 05:12:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:59,335 INFO L87 Difference]: Start difference. First operand has 401 states, 343 states have (on average 1.7113702623906706) internal successors, (587), 351 states have internal predecessors, (587), 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 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:00,842 INFO L93 Difference]: Finished difference Result 903 states and 1489 transitions. [2024-10-14 05:13:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 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 58 [2024-10-14 05:13:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:00,869 INFO L225 Difference]: With dead ends: 903 [2024-10-14 05:13:00,870 INFO L226 Difference]: Without dead ends: 520 [2024-10-14 05:13:00,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:00,887 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1323 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:00,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1371 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:13:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-14 05:13:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 483. [2024-10-14 05:13:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 408 states have (on average 1.5759803921568627) internal successors, (643), 415 states have internal predecessors, (643), 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) [2024-10-14 05:13:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 746 transitions. [2024-10-14 05:13:01,000 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 746 transitions. Word has length 58 [2024-10-14 05:13:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:01,001 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 746 transitions. [2024-10-14 05:13:01,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 746 transitions. [2024-10-14 05:13:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:01,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:01,007 INFO L215 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] [2024-10-14 05:13:01,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:13:01,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1239514470, now seen corresponding path program 1 times [2024-10-14 05:13:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397223002] [2024-10-14 05:13:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397223002] [2024-10-14 05:13:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397223002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767961916] [2024-10-14 05:13:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:01,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:01,229 INFO L87 Difference]: Start difference. First operand 483 states and 746 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:02,692 INFO L93 Difference]: Finished difference Result 803 states and 1196 transitions. [2024-10-14 05:13:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:13:02,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 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 58 [2024-10-14 05:13:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:02,698 INFO L225 Difference]: With dead ends: 803 [2024-10-14 05:13:02,699 INFO L226 Difference]: Without dead ends: 641 [2024-10-14 05:13:02,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:13:02,701 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1183 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:02,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1846 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:13:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-14 05:13:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 571. [2024-10-14 05:13:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 476 states have (on average 1.5525210084033614) internal successors, (739), 485 states have internal predecessors, (739), 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) [2024-10-14 05:13:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 872 transitions. [2024-10-14 05:13:02,762 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 872 transitions. Word has length 58 [2024-10-14 05:13:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 872 transitions. [2024-10-14 05:13:02,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 872 transitions. [2024-10-14 05:13:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:02,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:02,768 INFO L215 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] [2024-10-14 05:13:02,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:13:02,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:02,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash 688758232, now seen corresponding path program 1 times [2024-10-14 05:13:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920423148] [2024-10-14 05:13:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920423148] [2024-10-14 05:13:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920423148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487116546] [2024-10-14 05:13:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:02,969 INFO L87 Difference]: Start difference. First operand 571 states and 872 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:04,228 INFO L93 Difference]: Finished difference Result 845 states and 1258 transitions. [2024-10-14 05:13:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:04,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 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 58 [2024-10-14 05:13:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:04,235 INFO L225 Difference]: With dead ends: 845 [2024-10-14 05:13:04,235 INFO L226 Difference]: Without dead ends: 601 [2024-10-14 05:13:04,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:04,238 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 799 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:04,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1975 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-14 05:13:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 575. [2024-10-14 05:13:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 479 states have (on average 1.5448851774530272) internal successors, (740), 488 states have internal predecessors, (740), 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) [2024-10-14 05:13:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 874 transitions. [2024-10-14 05:13:04,310 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 874 transitions. Word has length 58 [2024-10-14 05:13:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:04,311 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 874 transitions. [2024-10-14 05:13:04,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 874 transitions. [2024-10-14 05:13:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:04,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:04,315 INFO L215 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] [2024-10-14 05:13:04,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:13:04,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:04,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1555225066, now seen corresponding path program 1 times [2024-10-14 05:13:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:04,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655161231] [2024-10-14 05:13:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655161231] [2024-10-14 05:13:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655161231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102961929] [2024-10-14 05:13:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:04,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:04,520 INFO L87 Difference]: Start difference. First operand 575 states and 874 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:05,694 INFO L93 Difference]: Finished difference Result 863 states and 1276 transitions. [2024-10-14 05:13:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:13:05,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 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 58 [2024-10-14 05:13:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:05,698 INFO L225 Difference]: With dead ends: 863 [2024-10-14 05:13:05,698 INFO L226 Difference]: Without dead ends: 615 [2024-10-14 05:13:05,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:13:05,701 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 805 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:05,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1974 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-14 05:13:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 587. [2024-10-14 05:13:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 488 states have (on average 1.5348360655737705) internal successors, (749), 497 states have internal predecessors, (749), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2024-10-14 05:13:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 886 transitions. [2024-10-14 05:13:05,764 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 886 transitions. Word has length 58 [2024-10-14 05:13:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 886 transitions. [2024-10-14 05:13:05,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 886 transitions. [2024-10-14 05:13:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:05,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:05,768 INFO L215 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] [2024-10-14 05:13:05,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:13:05,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:05,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1493185452, now seen corresponding path program 1 times [2024-10-14 05:13:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:05,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015771526] [2024-10-14 05:13:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:05,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015771526] [2024-10-14 05:13:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015771526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96495790] [2024-10-14 05:13:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:05,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:05,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:05,968 INFO L87 Difference]: Start difference. First operand 587 states and 886 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:07,110 INFO L93 Difference]: Finished difference Result 943 states and 1361 transitions. [2024-10-14 05:13:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:13:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 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 58 [2024-10-14 05:13:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:07,116 INFO L225 Difference]: With dead ends: 943 [2024-10-14 05:13:07,116 INFO L226 Difference]: Without dead ends: 685 [2024-10-14 05:13:07,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:13:07,119 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1496 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1389 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-14 05:13:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 597. [2024-10-14 05:13:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 496 states have (on average 1.5262096774193548) internal successors, (757), 505 states have internal predecessors, (757), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2024-10-14 05:13:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 894 transitions. [2024-10-14 05:13:07,160 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 894 transitions. Word has length 58 [2024-10-14 05:13:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:07,160 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 894 transitions. [2024-10-14 05:13:07,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 894 transitions. [2024-10-14 05:13:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:13:07,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:07,162 INFO L215 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] [2024-10-14 05:13:07,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:13:07,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:07,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1070483626, now seen corresponding path program 1 times [2024-10-14 05:13:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753885851] [2024-10-14 05:13:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753885851] [2024-10-14 05:13:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753885851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:07,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662498395] [2024-10-14 05:13:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:07,285 INFO L87 Difference]: Start difference. First operand 597 states and 894 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:08,158 INFO L93 Difference]: Finished difference Result 1179 states and 1681 transitions. [2024-10-14 05:13:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:13:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 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 58 [2024-10-14 05:13:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:08,166 INFO L225 Difference]: With dead ends: 1179 [2024-10-14 05:13:08,166 INFO L226 Difference]: Without dead ends: 912 [2024-10-14 05:13:08,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:08,170 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1489 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:08,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1100 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-14 05:13:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 858. [2024-10-14 05:13:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 691 states have (on average 1.4688856729377713) internal successors, (1015), 707 states have internal predecessors, (1015), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2024-10-14 05:13:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1244 transitions. [2024-10-14 05:13:08,237 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1244 transitions. Word has length 58 [2024-10-14 05:13:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:08,239 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1244 transitions. [2024-10-14 05:13:08,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:13:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1244 transitions. [2024-10-14 05:13:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:13:08,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:08,241 INFO L215 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] [2024-10-14 05:13:08,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:13:08,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:08,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -602571652, now seen corresponding path program 1 times [2024-10-14 05:13:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527747122] [2024-10-14 05:13:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527747122] [2024-10-14 05:13:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527747122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:08,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:08,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198014546] [2024-10-14 05:13:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:08,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:08,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:08,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:08,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:08,351 INFO L87 Difference]: Start difference. First operand 858 states and 1244 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:09,161 INFO L93 Difference]: Finished difference Result 1942 states and 2690 transitions. [2024-10-14 05:13:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:13:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 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 59 [2024-10-14 05:13:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:09,169 INFO L225 Difference]: With dead ends: 1942 [2024-10-14 05:13:09,169 INFO L226 Difference]: Without dead ends: 1423 [2024-10-14 05:13:09,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:09,172 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1189 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:09,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1131 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-10-14 05:13:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1269. [2024-10-14 05:13:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1002 states have (on average 1.4121756487025947) internal successors, (1415), 1025 states have internal predecessors, (1415), 147 states have call successors, (147), 94 states have call predecessors, (147), 118 states have return successors, (201), 156 states have call predecessors, (201), 143 states have call successors, (201) [2024-10-14 05:13:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1763 transitions. [2024-10-14 05:13:09,256 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1763 transitions. Word has length 59 [2024-10-14 05:13:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:09,256 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1763 transitions. [2024-10-14 05:13:09,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1763 transitions. [2024-10-14 05:13:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:13:09,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:09,258 INFO L215 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] [2024-10-14 05:13:09,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:13:09,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:09,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 363136743, now seen corresponding path program 1 times [2024-10-14 05:13:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067305859] [2024-10-14 05:13:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067305859] [2024-10-14 05:13:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067305859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062161380] [2024-10-14 05:13:09,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:09,334 INFO L87 Difference]: Start difference. First operand 1269 states and 1763 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:10,203 INFO L93 Difference]: Finished difference Result 3229 states and 4326 transitions. [2024-10-14 05:13:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 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 60 [2024-10-14 05:13:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:10,215 INFO L225 Difference]: With dead ends: 3229 [2024-10-14 05:13:10,215 INFO L226 Difference]: Without dead ends: 2269 [2024-10-14 05:13:10,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:10,218 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 718 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:10,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1328 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:13:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2024-10-14 05:13:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2085. [2024-10-14 05:13:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 1620 states have (on average 1.3623456790123456) internal successors, (2207), 1649 states have internal predecessors, (2207), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2024-10-14 05:13:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2787 transitions. [2024-10-14 05:13:10,372 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2787 transitions. Word has length 60 [2024-10-14 05:13:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:10,373 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 2787 transitions. [2024-10-14 05:13:10,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2787 transitions. [2024-10-14 05:13:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 05:13:10,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:10,377 INFO L215 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] [2024-10-14 05:13:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:13:10,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:10,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash 952697062, now seen corresponding path program 1 times [2024-10-14 05:13:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:10,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409376666] [2024-10-14 05:13:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409376666] [2024-10-14 05:13:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409376666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:10,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:10,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:10,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776675709] [2024-10-14 05:13:10,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:10,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:10,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:10,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:10,460 INFO L87 Difference]: Start difference. First operand 2085 states and 2787 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:11,332 INFO L93 Difference]: Finished difference Result 4749 states and 6191 transitions. [2024-10-14 05:13:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 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 66 [2024-10-14 05:13:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:11,349 INFO L225 Difference]: With dead ends: 4749 [2024-10-14 05:13:11,350 INFO L226 Difference]: Without dead ends: 2993 [2024-10-14 05:13:11,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:11,355 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1177 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:11,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1143 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2024-10-14 05:13:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2751. [2024-10-14 05:13:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2122 states have (on average 1.3407163053722904) internal successors, (2845), 2159 states have internal predecessors, (2845), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2024-10-14 05:13:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3614 transitions. [2024-10-14 05:13:11,627 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3614 transitions. Word has length 66 [2024-10-14 05:13:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:11,628 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3614 transitions. [2024-10-14 05:13:11,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:13:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3614 transitions. [2024-10-14 05:13:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 05:13:11,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:11,634 INFO L215 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] [2024-10-14 05:13:11,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:13:11,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:11,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1047983509, now seen corresponding path program 1 times [2024-10-14 05:13:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293621545] [2024-10-14 05:13:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293621545] [2024-10-14 05:13:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293621545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443704681] [2024-10-14 05:13:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:11,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:11,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:11,740 INFO L87 Difference]: Start difference. First operand 2751 states and 3614 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:12,651 INFO L93 Difference]: Finished difference Result 3471 states and 4491 transitions. [2024-10-14 05:13:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:13:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 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 67 [2024-10-14 05:13:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:12,669 INFO L225 Difference]: With dead ends: 3471 [2024-10-14 05:13:12,669 INFO L226 Difference]: Without dead ends: 3468 [2024-10-14 05:13:12,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:13:12,671 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 2072 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:12,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 862 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-14 05:13:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3201. [2024-10-14 05:13:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 2463 states have (on average 1.3288672350791717) internal successors, (3273), 2505 states have internal predecessors, (3273), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2024-10-14 05:13:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4171 transitions. [2024-10-14 05:13:13,023 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4171 transitions. Word has length 67 [2024-10-14 05:13:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4171 transitions. [2024-10-14 05:13:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4171 transitions. [2024-10-14 05:13:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 05:13:13,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:13,026 INFO L215 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] [2024-10-14 05:13:13,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:13:13,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1870924240, now seen corresponding path program 1 times [2024-10-14 05:13:13,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:13,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548373928] [2024-10-14 05:13:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548373928] [2024-10-14 05:13:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548373928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376030644] [2024-10-14 05:13:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:13,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:13,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:13,224 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) [2024-10-14 05:13:13,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:13:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:13,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:13:13,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:13,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:13:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376030644] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:13:13,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:13:13,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-14 05:13:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853729775] [2024-10-14 05:13:13,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:13:13,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:13:13,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:13:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:13,722 INFO L87 Difference]: Start difference. First operand 3201 states and 4171 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:13:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:15,853 INFO L93 Difference]: Finished difference Result 7268 states and 9283 transitions. [2024-10-14 05:13:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 05:13:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 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 68 [2024-10-14 05:13:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:15,885 INFO L225 Difference]: With dead ends: 7268 [2024-10-14 05:13:15,885 INFO L226 Difference]: Without dead ends: 7265 [2024-10-14 05:13:15,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-14 05:13:15,889 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 2498 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:15,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 1902 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:13:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2024-10-14 05:13:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 4827. [2024-10-14 05:13:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4827 states, 3703 states have (on average 1.3192006481231433) internal successors, (4885), 3767 states have internal predecessors, (4885), 555 states have call successors, (555), 452 states have call predecessors, (555), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2024-10-14 05:13:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 6245 transitions. [2024-10-14 05:13:16,463 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 6245 transitions. Word has length 68 [2024-10-14 05:13:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:16,464 INFO L471 AbstractCegarLoop]: Abstraction has 4827 states and 6245 transitions. [2024-10-14 05:13:16,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:13:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 6245 transitions. [2024-10-14 05:13:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:13:16,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:16,467 INFO L215 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] [2024-10-14 05:13:16,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:13:16,668 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,SelfDestructingSolverStorable10 [2024-10-14 05:13:16,669 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -600934869, now seen corresponding path program 2 times [2024-10-14 05:13:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677107143] [2024-10-14 05:13:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677107143] [2024-10-14 05:13:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677107143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709861076] [2024-10-14 05:13:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:16,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:16,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:16,743 INFO L87 Difference]: Start difference. First operand 4827 states and 6245 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:17,654 INFO L93 Difference]: Finished difference Result 7283 states and 9392 transitions. [2024-10-14 05:13:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:13:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 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 71 [2024-10-14 05:13:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:17,674 INFO L225 Difference]: With dead ends: 7283 [2024-10-14 05:13:17,674 INFO L226 Difference]: Without dead ends: 3580 [2024-10-14 05:13:17,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:17,685 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1370 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:17,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 940 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2024-10-14 05:13:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3351. [2024-10-14 05:13:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 2583 states have (on average 1.3073945025164537) internal successors, (3377), 2625 states have internal predecessors, (3377), 387 states have call successors, (387), 308 states have call predecessors, (387), 379 states have return successors, (531), 424 states have call predecessors, (531), 384 states have call successors, (531) [2024-10-14 05:13:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4295 transitions. [2024-10-14 05:13:18,036 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4295 transitions. Word has length 71 [2024-10-14 05:13:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:18,040 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4295 transitions. [2024-10-14 05:13:18,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:13:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4295 transitions. [2024-10-14 05:13:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:13:18,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:18,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:18,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:13:18,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:18,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -392745723, now seen corresponding path program 1 times [2024-10-14 05:13:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234816504] [2024-10-14 05:13:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:13:18,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:18,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234816504] [2024-10-14 05:13:18,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234816504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:18,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:18,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:13:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59447106] [2024-10-14 05:13:18,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:18,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:13:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:18,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:13:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:13:18,195 INFO L87 Difference]: Start difference. First operand 3351 states and 4295 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:19,969 INFO L93 Difference]: Finished difference Result 9649 states and 12138 transitions. [2024-10-14 05:13:19,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 05:13:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-14 05:13:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:20,000 INFO L225 Difference]: With dead ends: 9649 [2024-10-14 05:13:20,000 INFO L226 Difference]: Without dead ends: 5412 [2024-10-14 05:13:20,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-14 05:13:20,011 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1243 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:20,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1722 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2024-10-14 05:13:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5092. [2024-10-14 05:13:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 3867 states have (on average 1.273855702094647) internal successors, (4926), 3952 states have internal predecessors, (4926), 591 states have call successors, (591), 482 states have call predecessors, (591), 632 states have return successors, (913), 664 states have call predecessors, (913), 588 states have call successors, (913) [2024-10-14 05:13:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 6430 transitions. [2024-10-14 05:13:20,573 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 6430 transitions. Word has length 76 [2024-10-14 05:13:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:20,573 INFO L471 AbstractCegarLoop]: Abstraction has 5092 states and 6430 transitions. [2024-10-14 05:13:20,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 6430 transitions. [2024-10-14 05:13:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 05:13:20,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:20,580 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:20,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:13:20,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:20,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1057621740, now seen corresponding path program 1 times [2024-10-14 05:13:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754498405] [2024-10-14 05:13:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 05:13:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:13:20,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754498405] [2024-10-14 05:13:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754498405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:20,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:13:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878135229] [2024-10-14 05:13:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:13:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:13:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:20,731 INFO L87 Difference]: Start difference. First operand 5092 states and 6430 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:22,489 INFO L93 Difference]: Finished difference Result 8763 states and 10938 transitions. [2024-10-14 05:13:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 05:13:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 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 86 [2024-10-14 05:13:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:22,510 INFO L225 Difference]: With dead ends: 8763 [2024-10-14 05:13:22,510 INFO L226 Difference]: Without dead ends: 4583 [2024-10-14 05:13:22,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-14 05:13:22,521 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1742 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:22,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1727 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2024-10-14 05:13:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4249. [2024-10-14 05:13:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 3237 states have (on average 1.2684584491813407) internal successors, (4106), 3304 states have internal predecessors, (4106), 492 states have call successors, (492), 397 states have call predecessors, (492), 518 states have return successors, (691), 554 states have call predecessors, (691), 489 states have call successors, (691) [2024-10-14 05:13:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 5289 transitions. [2024-10-14 05:13:23,029 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 5289 transitions. Word has length 86 [2024-10-14 05:13:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:23,030 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 5289 transitions. [2024-10-14 05:13:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:13:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 5289 transitions. [2024-10-14 05:13:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:13:23,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:23,039 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:23,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:13:23,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:23,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash 702791445, now seen corresponding path program 1 times [2024-10-14 05:13:23,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735928821] [2024-10-14 05:13:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:13:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 05:13:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 05:13:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 05:13:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:13:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 05:13:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-14 05:13:23,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735928821] [2024-10-14 05:13:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735928821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906212478] [2024-10-14 05:13:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:23,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:23,259 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) [2024-10-14 05:13:23,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:13:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:23,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:13:23,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 05:13:23,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:13:23,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906212478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:23,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:13:23,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-14 05:13:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991457609] [2024-10-14 05:13:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:23,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:23,472 INFO L87 Difference]: Start difference. First operand 4249 states and 5289 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2024-10-14 05:13:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:23,859 INFO L93 Difference]: Finished difference Result 6096 states and 7542 transitions. [2024-10-14 05:13:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:13:23,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 131 [2024-10-14 05:13:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:23,871 INFO L225 Difference]: With dead ends: 6096 [2024-10-14 05:13:23,871 INFO L226 Difference]: Without dead ends: 2180 [2024-10-14 05:13:23,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:13:23,880 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:23,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2848 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:13:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-10-14 05:13:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2024-10-14 05:13:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1745 states have (on average 1.287679083094556) internal successors, (2247), 1761 states have internal predecessors, (2247), 216 states have call successors, (216), 163 states have call predecessors, (216), 217 states have return successors, (298), 256 states have call predecessors, (298), 213 states have call successors, (298) [2024-10-14 05:13:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2761 transitions. [2024-10-14 05:13:24,063 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2761 transitions. Word has length 131 [2024-10-14 05:13:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 2761 transitions. [2024-10-14 05:13:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2024-10-14 05:13:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2761 transitions. [2024-10-14 05:13:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 05:13:24,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:24,068 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:24,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 05:13:24,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 05:13:24,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:24,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1600186653, now seen corresponding path program 1 times [2024-10-14 05:13:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202644358] [2024-10-14 05:13:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:13:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 05:13:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 05:13:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:13:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 05:13:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 05:13:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:13:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-14 05:13:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202644358] [2024-10-14 05:13:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202644358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898395442] [2024-10-14 05:13:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:24,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:24,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:24,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:24,361 INFO L87 Difference]: Start difference. First operand 2180 states and 2761 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 05:13:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:25,102 INFO L93 Difference]: Finished difference Result 2245 states and 2829 transitions. [2024-10-14 05:13:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:25,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2024-10-14 05:13:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:25,116 INFO L225 Difference]: With dead ends: 2245 [2024-10-14 05:13:25,116 INFO L226 Difference]: Without dead ends: 1843 [2024-10-14 05:13:25,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:13:25,118 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 639 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:25,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1281 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:13:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-14 05:13:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1781. [2024-10-14 05:13:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1442 states have (on average 1.3065187239944522) internal successors, (1884), 1455 states have internal predecessors, (1884), 170 states have call successors, (170), 123 states have call predecessors, (170), 167 states have return successors, (234), 203 states have call predecessors, (234), 167 states have call successors, (234) [2024-10-14 05:13:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2288 transitions. [2024-10-14 05:13:25,275 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2288 transitions. Word has length 133 [2024-10-14 05:13:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:25,275 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2288 transitions. [2024-10-14 05:13:25,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 05:13:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2288 transitions. [2024-10-14 05:13:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:13:25,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:25,279 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:13:25,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1706471398, now seen corresponding path program 1 times [2024-10-14 05:13:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395076265] [2024-10-14 05:13:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:13:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:13:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 05:13:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 05:13:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:13:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 05:13:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 05:13:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 05:13:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395076265] [2024-10-14 05:13:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395076265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278626765] [2024-10-14 05:13:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:25,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:25,407 INFO L87 Difference]: Start difference. First operand 1781 states and 2288 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:13:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:26,411 INFO L93 Difference]: Finished difference Result 3128 states and 3957 transitions. [2024-10-14 05:13:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:13:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 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 145 [2024-10-14 05:13:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:26,420 INFO L225 Difference]: With dead ends: 3128 [2024-10-14 05:13:26,420 INFO L226 Difference]: Without dead ends: 1888 [2024-10-14 05:13:26,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:26,424 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 834 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:26,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1424 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:13:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-10-14 05:13:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1706. [2024-10-14 05:13:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1389 states have (on average 1.306695464362851) internal successors, (1815), 1403 states have internal predecessors, (1815), 161 states have call successors, (161), 118 states have call predecessors, (161), 154 states have return successors, (218), 185 states have call predecessors, (218), 158 states have call successors, (218) [2024-10-14 05:13:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2194 transitions. [2024-10-14 05:13:26,581 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2194 transitions. Word has length 145 [2024-10-14 05:13:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:26,582 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2194 transitions. [2024-10-14 05:13:26,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 05:13:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2194 transitions. [2024-10-14 05:13:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-14 05:13:26,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:26,586 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:13:26,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:13:26,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1034542947, now seen corresponding path program 1 times [2024-10-14 05:13:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562638130] [2024-10-14 05:13:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:13:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:13:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:13:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:13:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 05:13:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 05:13:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 05:13:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 05:13:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:13:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:13:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 05:13:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 05:13:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 05:13:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 05:13:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562638130] [2024-10-14 05:13:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562638130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:13:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932440667] [2024-10-14 05:13:26,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:13:26,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:13:26,881 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) [2024-10-14 05:13:26,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:13:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:27,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 05:13:27,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:13:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 05:13:27,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:13:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-14 05:13:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932440667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:13:27,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:13:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-14 05:13:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366408539] [2024-10-14 05:13:27,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:13:27,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 05:13:27,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 05:13:27,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-14 05:13:27,408 INFO L87 Difference]: Start difference. First operand 1706 states and 2194 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-14 05:13:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:28,849 INFO L93 Difference]: Finished difference Result 3513 states and 4482 transitions. [2024-10-14 05:13:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 05:13:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-14 05:13:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:28,858 INFO L225 Difference]: With dead ends: 3513 [2024-10-14 05:13:28,859 INFO L226 Difference]: Without dead ends: 2211 [2024-10-14 05:13:28,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-14 05:13:28,863 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1438 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:28,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1821 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:13:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2024-10-14 05:13:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2067. [2024-10-14 05:13:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1638 states have (on average 1.2753357753357752) internal successors, (2089), 1660 states have internal predecessors, (2089), 215 states have call successors, (215), 168 states have call predecessors, (215), 212 states have return successors, (332), 239 states have call predecessors, (332), 212 states have call successors, (332) [2024-10-14 05:13:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2636 transitions. [2024-10-14 05:13:29,036 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2636 transitions. Word has length 147 [2024-10-14 05:13:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:29,037 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2636 transitions. [2024-10-14 05:13:29,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-14 05:13:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2636 transitions. [2024-10-14 05:13:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:29,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:29,042 INFO L215 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] [2024-10-14 05:13:29,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:13:29,242 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 [2024-10-14 05:13:29,243 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1939723724, now seen corresponding path program 1 times [2024-10-14 05:13:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369384711] [2024-10-14 05:13:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:29,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369384711] [2024-10-14 05:13:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369384711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:29,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:29,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:13:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644499704] [2024-10-14 05:13:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:29,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:13:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:13:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:13:29,425 INFO L87 Difference]: Start difference. First operand 2067 states and 2636 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:31,142 INFO L93 Difference]: Finished difference Result 2476 states and 3317 transitions. [2024-10-14 05:13:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:31,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2024-10-14 05:13:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:31,154 INFO L225 Difference]: With dead ends: 2476 [2024-10-14 05:13:31,154 INFO L226 Difference]: Without dead ends: 2177 [2024-10-14 05:13:31,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:13:31,157 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 939 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:31,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 773 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2024-10-14 05:13:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2067. [2024-10-14 05:13:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1638 states have (on average 1.2747252747252746) internal successors, (2088), 1660 states have internal predecessors, (2088), 215 states have call successors, (215), 168 states have call predecessors, (215), 212 states have return successors, (332), 239 states have call predecessors, (332), 212 states have call successors, (332) [2024-10-14 05:13:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2635 transitions. [2024-10-14 05:13:31,701 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2635 transitions. Word has length 142 [2024-10-14 05:13:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:31,702 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2635 transitions. [2024-10-14 05:13:31,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2635 transitions. [2024-10-14 05:13:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:31,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:31,707 INFO L215 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] [2024-10-14 05:13:31,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:13:31,707 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:31,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2066424182, now seen corresponding path program 1 times [2024-10-14 05:13:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811942170] [2024-10-14 05:13:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:31,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:31,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811942170] [2024-10-14 05:13:31,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811942170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:31,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:31,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:13:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618749268] [2024-10-14 05:13:31,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:13:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:13:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:13:31,935 INFO L87 Difference]: Start difference. First operand 2067 states and 2635 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:34,611 INFO L93 Difference]: Finished difference Result 2884 states and 3997 transitions. [2024-10-14 05:13:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:13:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:34,620 INFO L225 Difference]: With dead ends: 2884 [2024-10-14 05:13:34,620 INFO L226 Difference]: Without dead ends: 2593 [2024-10-14 05:13:34,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:34,622 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1474 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:34,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1143 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:13:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2024-10-14 05:13:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2372. [2024-10-14 05:13:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1917 states have (on average 1.3291601460615545) internal successors, (2548), 1940 states have internal predecessors, (2548), 234 states have call successors, (234), 174 states have call predecessors, (234), 219 states have return successors, (354), 258 states have call predecessors, (354), 231 states have call successors, (354) [2024-10-14 05:13:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3136 transitions. [2024-10-14 05:13:35,003 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3136 transitions. Word has length 142 [2024-10-14 05:13:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:35,004 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3136 transitions. [2024-10-14 05:13:35,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3136 transitions. [2024-10-14 05:13:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:35,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:35,010 INFO L215 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] [2024-10-14 05:13:35,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:13:35,011 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:35,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1556450486, now seen corresponding path program 1 times [2024-10-14 05:13:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100754001] [2024-10-14 05:13:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100754001] [2024-10-14 05:13:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100754001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82094008] [2024-10-14 05:13:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:35,288 INFO L87 Difference]: Start difference. First operand 2372 states and 3136 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:38,660 INFO L93 Difference]: Finished difference Result 3619 states and 5215 transitions. [2024-10-14 05:13:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:38,673 INFO L225 Difference]: With dead ends: 3619 [2024-10-14 05:13:38,673 INFO L226 Difference]: Without dead ends: 3023 [2024-10-14 05:13:38,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:38,678 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1499 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3449 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:38,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 2057 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3449 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:13:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2024-10-14 05:13:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2654. [2024-10-14 05:13:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2173 states have (on average 1.3630924988495168) internal successors, (2962), 2197 states have internal predecessors, (2962), 253 states have call successors, (253), 180 states have call predecessors, (253), 226 states have return successors, (375), 278 states have call predecessors, (375), 250 states have call successors, (375) [2024-10-14 05:13:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3590 transitions. [2024-10-14 05:13:39,141 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3590 transitions. Word has length 142 [2024-10-14 05:13:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:39,142 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 3590 transitions. [2024-10-14 05:13:39,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3590 transitions. [2024-10-14 05:13:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:39,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:39,146 INFO L215 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] [2024-10-14 05:13:39,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:13:39,147 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:39,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash -493958412, now seen corresponding path program 1 times [2024-10-14 05:13:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016791456] [2024-10-14 05:13:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:39,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016791456] [2024-10-14 05:13:39,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016791456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:39,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729285917] [2024-10-14 05:13:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:39,380 INFO L87 Difference]: Start difference. First operand 2654 states and 3590 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:42,711 INFO L93 Difference]: Finished difference Result 4696 states and 6989 transitions. [2024-10-14 05:13:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:42,727 INFO L225 Difference]: With dead ends: 4696 [2024-10-14 05:13:42,728 INFO L226 Difference]: Without dead ends: 3818 [2024-10-14 05:13:42,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:42,733 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1497 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3445 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:42,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 2055 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3445 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 05:13:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-10-14 05:13:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3219. [2024-10-14 05:13:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4113924050632911) internal successors, (3791), 2712 states have internal predecessors, (3791), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-14 05:13:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4503 transitions. [2024-10-14 05:13:43,275 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4503 transitions. Word has length 142 [2024-10-14 05:13:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:43,275 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4503 transitions. [2024-10-14 05:13:43,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4503 transitions. [2024-10-14 05:13:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:43,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:43,280 INFO L215 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] [2024-10-14 05:13:43,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:13:43,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:43,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -5911306, now seen corresponding path program 1 times [2024-10-14 05:13:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:43,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136586146] [2024-10-14 05:13:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136586146] [2024-10-14 05:13:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136586146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:43,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580762479] [2024-10-14 05:13:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:43,482 INFO L87 Difference]: Start difference. First operand 3219 states and 4503 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:45,594 INFO L93 Difference]: Finished difference Result 5249 states and 7893 transitions. [2024-10-14 05:13:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:45,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:45,611 INFO L225 Difference]: With dead ends: 5249 [2024-10-14 05:13:45,612 INFO L226 Difference]: Without dead ends: 3806 [2024-10-14 05:13:45,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:45,619 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1135 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:45,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1159 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:13:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2024-10-14 05:13:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3219. [2024-10-14 05:13:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4095309009679822) internal successors, (3786), 2712 states have internal predecessors, (3786), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-14 05:13:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4498 transitions. [2024-10-14 05:13:46,194 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4498 transitions. Word has length 142 [2024-10-14 05:13:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:46,195 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4498 transitions. [2024-10-14 05:13:46,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4498 transitions. [2024-10-14 05:13:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:46,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:46,200 INFO L215 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] [2024-10-14 05:13:46,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:13:46,201 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:46,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1098546508, now seen corresponding path program 1 times [2024-10-14 05:13:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:46,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833331301] [2024-10-14 05:13:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833331301] [2024-10-14 05:13:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833331301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481247248] [2024-10-14 05:13:46,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:46,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:46,419 INFO L87 Difference]: Start difference. First operand 3219 states and 4498 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:48,397 INFO L93 Difference]: Finished difference Result 5243 states and 7867 transitions. [2024-10-14 05:13:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:48,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:48,410 INFO L225 Difference]: With dead ends: 5243 [2024-10-14 05:13:48,410 INFO L226 Difference]: Without dead ends: 3800 [2024-10-14 05:13:48,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:48,417 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1203 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:48,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1158 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:13:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2024-10-14 05:13:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3219. [2024-10-14 05:13:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4076693968726732) internal successors, (3781), 2712 states have internal predecessors, (3781), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-14 05:13:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4493 transitions. [2024-10-14 05:13:48,920 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4493 transitions. Word has length 142 [2024-10-14 05:13:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:48,921 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4493 transitions. [2024-10-14 05:13:48,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4493 transitions. [2024-10-14 05:13:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:48,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:48,925 INFO L215 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] [2024-10-14 05:13:48,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:13:48,926 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1914248502, now seen corresponding path program 1 times [2024-10-14 05:13:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534574031] [2024-10-14 05:13:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534574031] [2024-10-14 05:13:49,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534574031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:49,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:49,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054132510] [2024-10-14 05:13:49,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:49,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:49,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:49,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:49,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:49,172 INFO L87 Difference]: Start difference. First operand 3219 states and 4493 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:50,846 INFO L93 Difference]: Finished difference Result 5236 states and 7839 transitions. [2024-10-14 05:13:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:50,859 INFO L225 Difference]: With dead ends: 5236 [2024-10-14 05:13:50,859 INFO L226 Difference]: Without dead ends: 3793 [2024-10-14 05:13:50,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:50,864 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1315 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:50,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 966 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:13:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2024-10-14 05:13:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3219. [2024-10-14 05:13:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.405807892777364) internal successors, (3776), 2712 states have internal predecessors, (3776), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-14 05:13:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4488 transitions. [2024-10-14 05:13:51,356 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4488 transitions. Word has length 142 [2024-10-14 05:13:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:51,357 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4488 transitions. [2024-10-14 05:13:51,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4488 transitions. [2024-10-14 05:13:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:51,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:51,362 INFO L215 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] [2024-10-14 05:13:51,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:13:51,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 71772788, now seen corresponding path program 1 times [2024-10-14 05:13:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445781182] [2024-10-14 05:13:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:51,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:51,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445781182] [2024-10-14 05:13:51,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445781182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:51,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:51,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882466462] [2024-10-14 05:13:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:51,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:51,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:51,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:51,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:51,556 INFO L87 Difference]: Start difference. First operand 3219 states and 4488 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:53,572 INFO L93 Difference]: Finished difference Result 5224 states and 7801 transitions. [2024-10-14 05:13:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:13:53,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:53,584 INFO L225 Difference]: With dead ends: 5224 [2024-10-14 05:13:53,584 INFO L226 Difference]: Without dead ends: 3781 [2024-10-14 05:13:53,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:13:53,589 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1133 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:53,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1159 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:13:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2024-10-14 05:13:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3219. [2024-10-14 05:13:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2686 states have (on average 1.4039463886820551) internal successors, (3771), 2712 states have internal predecessors, (3771), 291 states have call successors, (291), 192 states have call predecessors, (291), 240 states have return successors, (421), 318 states have call predecessors, (421), 288 states have call successors, (421) [2024-10-14 05:13:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4483 transitions. [2024-10-14 05:13:54,005 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4483 transitions. Word has length 142 [2024-10-14 05:13:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:54,006 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4483 transitions. [2024-10-14 05:13:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4483 transitions. [2024-10-14 05:13:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:54,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:54,010 INFO L215 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] [2024-10-14 05:13:54,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:13:54,010 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:54,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash -260870350, now seen corresponding path program 1 times [2024-10-14 05:13:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:54,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954559042] [2024-10-14 05:13:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954559042] [2024-10-14 05:13:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954559042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:54,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:54,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735511398] [2024-10-14 05:13:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:54,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:54,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:54,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:54,219 INFO L87 Difference]: Start difference. First operand 3219 states and 4483 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:13:57,586 INFO L93 Difference]: Finished difference Result 6728 states and 10220 transitions. [2024-10-14 05:13:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:13:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:13:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:13:57,606 INFO L225 Difference]: With dead ends: 6728 [2024-10-14 05:13:57,606 INFO L226 Difference]: Without dead ends: 5285 [2024-10-14 05:13:57,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:13:57,614 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1468 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3315 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:13:57,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 2055 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3315 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 05:13:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-10-14 05:13:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 4372. [2024-10-14 05:13:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 3735 states have (on average 1.4575635876840696) internal successors, (5444), 3765 states have internal predecessors, (5444), 367 states have call successors, (367), 216 states have call predecessors, (367), 268 states have return successors, (519), 398 states have call predecessors, (519), 364 states have call successors, (519) [2024-10-14 05:13:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 6330 transitions. [2024-10-14 05:13:58,296 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 6330 transitions. Word has length 142 [2024-10-14 05:13:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:13:58,296 INFO L471 AbstractCegarLoop]: Abstraction has 4372 states and 6330 transitions. [2024-10-14 05:13:58,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:13:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 6330 transitions. [2024-10-14 05:13:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:13:58,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:13:58,301 INFO L215 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] [2024-10-14 05:13:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:13:58,301 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:13:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:13:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1668061876, now seen corresponding path program 1 times [2024-10-14 05:13:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:13:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284331931] [2024-10-14 05:13:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:13:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:13:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:13:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:13:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:13:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:13:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:13:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:13:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:13:58,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:13:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284331931] [2024-10-14 05:13:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284331931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:13:58,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:13:58,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:13:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740907596] [2024-10-14 05:13:58,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:13:58,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:13:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:13:58,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:13:58,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:13:58,528 INFO L87 Difference]: Start difference. First operand 4372 states and 6330 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:01,916 INFO L93 Difference]: Finished difference Result 10857 states and 16919 transitions. [2024-10-14 05:14:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:14:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:01,943 INFO L225 Difference]: With dead ends: 10857 [2024-10-14 05:14:01,944 INFO L226 Difference]: Without dead ends: 8261 [2024-10-14 05:14:01,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:01,957 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1467 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:01,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2055 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 05:14:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2024-10-14 05:14:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 6675. [2024-10-14 05:14:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6675 states, 5830 states have (on average 1.5060034305317325) internal successors, (8780), 5868 states have internal predecessors, (8780), 519 states have call successors, (519), 264 states have call predecessors, (519), 324 states have return successors, (733), 558 states have call predecessors, (733), 516 states have call successors, (733) [2024-10-14 05:14:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6675 states to 6675 states and 10032 transitions. [2024-10-14 05:14:02,643 INFO L78 Accepts]: Start accepts. Automaton has 6675 states and 10032 transitions. Word has length 142 [2024-10-14 05:14:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:02,644 INFO L471 AbstractCegarLoop]: Abstraction has 6675 states and 10032 transitions. [2024-10-14 05:14:02,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6675 states and 10032 transitions. [2024-10-14 05:14:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 05:14:02,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:02,650 INFO L215 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] [2024-10-14 05:14:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 05:14:02,651 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:02,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -625019150, now seen corresponding path program 1 times [2024-10-14 05:14:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434156367] [2024-10-14 05:14:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:14:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:14:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:14:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:14:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:14:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434156367] [2024-10-14 05:14:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434156367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:14:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567928519] [2024-10-14 05:14:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:14:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:02,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:14:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:14:02,886 INFO L87 Difference]: Start difference. First operand 6675 states and 10032 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:14:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:06,563 INFO L93 Difference]: Finished difference Result 19106 states and 30359 transitions. [2024-10-14 05:14:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (6), 4 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 142 [2024-10-14 05:14:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:06,605 INFO L225 Difference]: With dead ends: 19106 [2024-10-14 05:14:06,605 INFO L226 Difference]: Without dead ends: 14207 [2024-10-14 05:14:06,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:14:06,621 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1466 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 3289 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:06,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 2055 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3289 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 05:14:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states.