./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_3.cil+token_ring.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:06:54,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:06:54,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:06:54,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:06:54,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:06:54,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:06:54,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:06:54,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:06:54,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:06:54,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:06:54,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:06:54,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:06:54,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:06:54,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:06:54,225 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:06:54,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:06:54,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:06:54,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:06:54,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:06:54,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:06:54,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:06:54,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:06:54,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:06:54,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:06:54,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:06:54,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:06:54,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:06:54,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:06:54,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:06:54,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:06:54,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:06:54,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:06:54,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:54,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:06:54,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:06:54,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:06:54,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:06:54,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:06:54,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:06:54,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:06:54,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:06:54,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:06:54,238 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-clean/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-clean/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 -> 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f [2024-10-11 05:06:54,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:06:54,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:06:54,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:06:54,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:06:54,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:06:54,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2024-10-11 05:06:55,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:06:56,220 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:06:56,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2024-10-11 05:06:56,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fbfa26663/00b7466966e448c5b36be4c9a67ea066/FLAG6bafe1d8c [2024-10-11 05:06:56,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fbfa26663/00b7466966e448c5b36be4c9a67ea066 [2024-10-11 05:06:56,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:06:56,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:06:56,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:56,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:06:56,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:06:56,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec98c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56, skipping insertion in model container [2024-10-11 05:06:56,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:06:56,501 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_3.cil+token_ring.10.cil-1.c[911,924] [2024-10-11 05:06:56,606 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_3.cil+token_ring.10.cil-1.c[8416,8429] [2024-10-11 05:06:56,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:56,729 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:06:56,741 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_3.cil+token_ring.10.cil-1.c[911,924] [2024-10-11 05:06:56,767 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_3.cil+token_ring.10.cil-1.c[8416,8429] [2024-10-11 05:06:56,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:56,844 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:06:56,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56 WrapperNode [2024-10-11 05:06:56,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:56,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:56,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:06:56,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:06:56,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,918 INFO L138 Inliner]: procedures = 75, calls = 92, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 992 [2024-10-11 05:06:56,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:56,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:06:56,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:06:56,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:06:56,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,959 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-11 05:06:56,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:56,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:57,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:57,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:57,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:06:57,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:06:57,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:06:57,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:06:57,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (1/1) ... [2024-10-11 05:06:57,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:57,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:06:57,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:06:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:06:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:06:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:06:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:06:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:06:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:06:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:06:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:06:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:06:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:06:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:06:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:06:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:06:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:06:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:06:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:06:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:06:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:06:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:06:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:06:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:06:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:06:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:06:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:06:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:06:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:06:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:06:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:06:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:06:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:06:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:06:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:06:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:06:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:06:57,289 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:06:57,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:06:58,080 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:06:58,081 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-11 05:06:58,310 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-11 05:06:58,310 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:06:58,400 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:06:58,400 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-11 05:06:58,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:58 BoogieIcfgContainer [2024-10-11 05:06:58,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:06:58,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:06:58,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:06:58,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:06:58,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:06:56" (1/3) ... [2024-10-11 05:06:58,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3645680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:58, skipping insertion in model container [2024-10-11 05:06:58,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:56" (2/3) ... [2024-10-11 05:06:58,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3645680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:58, skipping insertion in model container [2024-10-11 05:06:58,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:58" (3/3) ... [2024-10-11 05:06:58,411 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-1.c [2024-10-11 05:06:58,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:06:58,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:06:58,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:06:58,502 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;@7106e07b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:06:58,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:06:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 414 states, 354 states have (on average 1.7118644067796611) internal successors, (606), 362 states have internal predecessors, (606), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 05:06:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:58,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:58,520 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] [2024-10-11 05:06:58,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:58,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1036360840, now seen corresponding path program 1 times [2024-10-11 05:06:58,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:58,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731328206] [2024-10-11 05:06:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:58,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,122 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-11 05:06:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:59,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731328206] [2024-10-11 05:06:59,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731328206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055900580] [2024-10-11 05:06:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:59,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:59,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:59,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:59,170 INFO L87 Difference]: Start difference. First operand has 414 states, 354 states have (on average 1.7118644067796611) internal successors, (606), 362 states have internal predecessors, (606), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-11 05:07:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:00,801 INFO L93 Difference]: Finished difference Result 942 states and 1561 transitions. [2024-10-11 05:07:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:00,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2024-10-11 05:07:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:00,824 INFO L225 Difference]: With dead ends: 942 [2024-10-11 05:07:00,825 INFO L226 Difference]: Without dead ends: 546 [2024-10-11 05:07:00,835 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-11 05:07:00,841 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1103 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:00,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1685 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:07:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-11 05:07:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 509. [2024-10-11 05:07:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 430 states have (on average 1.583720930232558) internal successors, (681), 437 states have internal predecessors, (681), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2024-10-11 05:07:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 792 transitions. [2024-10-11 05:07:00,962 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 792 transitions. Word has length 57 [2024-10-11 05:07:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:00,963 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 792 transitions. [2024-10-11 05:07:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-11 05:07:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 792 transitions. [2024-10-11 05:07:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:07:00,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:00,968 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] [2024-10-11 05:07:00,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:07:00,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:00,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -907631928, now seen corresponding path program 1 times [2024-10-11 05:07:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:00,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269685978] [2024-10-11 05:07:00,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:07:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:07:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,263 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-11 05:07:01,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:01,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269685978] [2024-10-11 05:07:01,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269685978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:01,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:01,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:07:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636001602] [2024-10-11 05:07:01,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:01,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:07:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:07:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:07:01,272 INFO L87 Difference]: Start difference. First operand 509 states and 792 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-11 05:07:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:02,963 INFO L93 Difference]: Finished difference Result 870 states and 1322 transitions. [2024-10-11 05:07:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:07:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2024-10-11 05:07:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:02,974 INFO L225 Difference]: With dead ends: 870 [2024-10-11 05:07:02,975 INFO L226 Difference]: Without dead ends: 682 [2024-10-11 05:07:02,977 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-11 05:07:02,978 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1240 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:02,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1978 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:07:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-11 05:07:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 610. [2024-10-11 05:07:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 509 states have (on average 1.5638506876227898) internal successors, (796), 518 states have internal predecessors, (796), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2024-10-11 05:07:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 941 transitions. [2024-10-11 05:07:03,053 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 941 transitions. Word has length 57 [2024-10-11 05:07:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 941 transitions. [2024-10-11 05:07:03,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-11 05:07:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 941 transitions. [2024-10-11 05:07:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:07:03,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:03,061 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] [2024-10-11 05:07:03,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:07:03,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:03,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash -14145590, now seen corresponding path program 1 times [2024-10-11 05:07:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:03,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645136625] [2024-10-11 05:07:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:07:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:07:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,271 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-11 05:07:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645136625] [2024-10-11 05:07:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645136625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:03,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:03,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:07:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84950631] [2024-10-11 05:07:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:03,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:07:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:07:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:07:03,276 INFO L87 Difference]: Start difference. First operand 610 states and 941 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 05:07:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:05,605 INFO L93 Difference]: Finished difference Result 2008 states and 2991 transitions. [2024-10-11 05:07:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:07:05,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2024-10-11 05:07:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:05,620 INFO L225 Difference]: With dead ends: 2008 [2024-10-11 05:07:05,621 INFO L226 Difference]: Without dead ends: 1707 [2024-10-11 05:07:05,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:07:05,625 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 3329 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3347 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:05,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3347 Valid, 2226 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:07:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-10-11 05:07:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1574. [2024-10-11 05:07:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1268 states have (on average 1.4597791798107256) internal successors, (1851), 1292 states have internal predecessors, (1851), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2024-10-11 05:07:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2239 transitions. [2024-10-11 05:07:05,796 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2239 transitions. Word has length 57 [2024-10-11 05:07:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:05,797 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2239 transitions. [2024-10-11 05:07:05,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 05:07:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2239 transitions. [2024-10-11 05:07:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:07:05,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:05,802 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-11 05:07:05,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:07:05,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:05,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1585612455, now seen corresponding path program 1 times [2024-10-11 05:07:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763451862] [2024-10-11 05:07:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:07:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,980 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-11 05:07:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763451862] [2024-10-11 05:07:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763451862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279513284] [2024-10-11 05:07:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:05,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:05,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:05,983 INFO L87 Difference]: Start difference. First operand 1574 states and 2239 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-11 05:07:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:07,465 INFO L93 Difference]: Finished difference Result 2955 states and 4163 transitions. [2024-10-11 05:07:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:07:07,469 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-11 05:07:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:07,484 INFO L225 Difference]: With dead ends: 2955 [2024-10-11 05:07:07,485 INFO L226 Difference]: Without dead ends: 1696 [2024-10-11 05:07:07,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:07:07,493 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 553 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:07,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2311 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:07:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-10-11 05:07:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1606. [2024-10-11 05:07:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1292 states have (on average 1.446594427244582) internal successors, (1869), 1316 states have internal predecessors, (1869), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2024-10-11 05:07:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2265 transitions. [2024-10-11 05:07:07,606 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2265 transitions. Word has length 58 [2024-10-11 05:07:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2265 transitions. [2024-10-11 05:07:07,606 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-11 05:07:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2265 transitions. [2024-10-11 05:07:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:07:07,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:07,607 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-11 05:07:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:07:07,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:07,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1513225897, now seen corresponding path program 1 times [2024-10-11 05:07:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783950683] [2024-10-11 05:07:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:07:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,756 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-11 05:07:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:07,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783950683] [2024-10-11 05:07:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783950683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:07,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:07,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:07:07,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260526681] [2024-10-11 05:07:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:07,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:07:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:07,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:07:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:07:07,759 INFO L87 Difference]: Start difference. First operand 1606 states and 2265 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:07:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:09,934 INFO L93 Difference]: Finished difference Result 4865 states and 6826 transitions. [2024-10-11 05:07:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:07:09,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:07:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:09,947 INFO L225 Difference]: With dead ends: 4865 [2024-10-11 05:07:09,948 INFO L226 Difference]: Without dead ends: 1976 [2024-10-11 05:07:09,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:07:09,957 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 3897 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3915 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:09,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3915 Valid, 1935 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:07:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2024-10-11 05:07:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1820. [2024-10-11 05:07:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1434 states have (on average 1.393305439330544) internal successors, (1998), 1460 states have internal predecessors, (1998), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2024-10-11 05:07:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2480 transitions. [2024-10-11 05:07:10,124 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2480 transitions. Word has length 58 [2024-10-11 05:07:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:10,125 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2480 transitions. [2024-10-11 05:07:10,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:07:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2480 transitions. [2024-10-11 05:07:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:10,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:10,128 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, 1, 1, 1, 1] [2024-10-11 05:07:10,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:07:10,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 63774575, now seen corresponding path program 1 times [2024-10-11 05:07:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795632454] [2024-10-11 05:07:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:07:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795632454] [2024-10-11 05:07:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795632454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106922826] [2024-10-11 05:07:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:10,325 INFO L87 Difference]: Start difference. First operand 1820 states and 2480 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 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-11 05:07:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:11,592 INFO L93 Difference]: Finished difference Result 3489 states and 4718 transitions. [2024-10-11 05:07:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:07:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 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 80 [2024-10-11 05:07:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:11,605 INFO L225 Difference]: With dead ends: 3489 [2024-10-11 05:07:11,605 INFO L226 Difference]: Without dead ends: 1984 [2024-10-11 05:07:11,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:07:11,611 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 821 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:11,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 2021 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:07:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-10-11 05:07:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1868. [2024-10-11 05:07:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1470 states have (on average 1.379591836734694) internal successors, (2028), 1496 states have internal predecessors, (2028), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2024-10-11 05:07:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2522 transitions. [2024-10-11 05:07:11,755 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2522 transitions. Word has length 80 [2024-10-11 05:07:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:11,756 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 2522 transitions. [2024-10-11 05:07:11,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 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-11 05:07:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2522 transitions. [2024-10-11 05:07:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:11,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:11,758 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, 1, 1, 1, 1] [2024-10-11 05:07:11,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:07:11,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1992047277, now seen corresponding path program 1 times [2024-10-11 05:07:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597858828] [2024-10-11 05:07:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:07:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597858828] [2024-10-11 05:07:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597858828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:07:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120279210] [2024-10-11 05:07:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:07:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:07:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:07:11,993 INFO L87 Difference]: Start difference. First operand 1868 states and 2522 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-11 05:07:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:13,172 INFO L93 Difference]: Finished difference Result 3267 states and 4358 transitions. [2024-10-11 05:07:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:07:13,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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 80 [2024-10-11 05:07:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:13,186 INFO L225 Difference]: With dead ends: 3267 [2024-10-11 05:07:13,187 INFO L226 Difference]: Without dead ends: 1935 [2024-10-11 05:07:13,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-11 05:07:13,193 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1551 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:13,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1464 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:07:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2024-10-11 05:07:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1660. [2024-10-11 05:07:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1315 states have (on average 1.3863117870722435) internal successors, (1823), 1336 states have internal predecessors, (1823), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2024-10-11 05:07:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2249 transitions. [2024-10-11 05:07:13,342 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2249 transitions. Word has length 80 [2024-10-11 05:07:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:13,342 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2249 transitions. [2024-10-11 05:07:13,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-11 05:07:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2249 transitions. [2024-10-11 05:07:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:13,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:13,344 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, 1, 1, 1, 1] [2024-10-11 05:07:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:07:13,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1879273297, now seen corresponding path program 1 times [2024-10-11 05:07:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475736058] [2024-10-11 05:07:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:07:13,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475736058] [2024-10-11 05:07:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475736058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58904089] [2024-10-11 05:07:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:13,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:13,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:13,451 INFO L87 Difference]: Start difference. First operand 1660 states and 2249 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 05:07:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:14,405 INFO L93 Difference]: Finished difference Result 4560 states and 6109 transitions. [2024-10-11 05:07:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:07:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-10-11 05:07:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:14,423 INFO L225 Difference]: With dead ends: 4560 [2024-10-11 05:07:14,423 INFO L226 Difference]: Without dead ends: 3216 [2024-10-11 05:07:14,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:07:14,430 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1179 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:14,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1472 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:07:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2024-10-11 05:07:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3006. [2024-10-11 05:07:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 2341 states have (on average 1.3361811191798376) internal successors, (3128), 2391 states have internal predecessors, (3128), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2024-10-11 05:07:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 3998 transitions. [2024-10-11 05:07:14,725 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 3998 transitions. Word has length 80 [2024-10-11 05:07:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:14,726 INFO L471 AbstractCegarLoop]: Abstraction has 3006 states and 3998 transitions. [2024-10-11 05:07:14,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 05:07:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 3998 transitions. [2024-10-11 05:07:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:14,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:14,729 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, 1, 1, 1, 1] [2024-10-11 05:07:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:07:14,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1802372499, now seen corresponding path program 1 times [2024-10-11 05:07:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289136075] [2024-10-11 05:07:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:07:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289136075] [2024-10-11 05:07:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289136075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:07:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706561032] [2024-10-11 05:07:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:07:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:07:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:07:14,826 INFO L87 Difference]: Start difference. First operand 3006 states and 3998 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:15,525 INFO L93 Difference]: Finished difference Result 4463 states and 5855 transitions. [2024-10-11 05:07:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:07:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-11 05:07:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:15,537 INFO L225 Difference]: With dead ends: 4463 [2024-10-11 05:07:15,537 INFO L226 Difference]: Without dead ends: 1773 [2024-10-11 05:07:15,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:15,547 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 661 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:15,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1314 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:07:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2024-10-11 05:07:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1660. [2024-10-11 05:07:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1315 states have (on average 1.3581749049429659) internal successors, (1786), 1336 states have internal predecessors, (1786), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2024-10-11 05:07:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2212 transitions. [2024-10-11 05:07:15,707 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2212 transitions. Word has length 80 [2024-10-11 05:07:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:15,707 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2212 transitions. [2024-10-11 05:07:15,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2212 transitions. [2024-10-11 05:07:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 05:07:15,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:15,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:15,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:07:15,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1006521576, now seen corresponding path program 1 times [2024-10-11 05:07:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:15,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234173871] [2024-10-11 05:07:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:07:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:07:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234173871] [2024-10-11 05:07:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234173871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384558151] [2024-10-11 05:07:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:15,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:15,856 INFO L87 Difference]: Start difference. First operand 1660 states and 2212 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 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-11 05:07:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:17,343 INFO L93 Difference]: Finished difference Result 3881 states and 5098 transitions. [2024-10-11 05:07:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 05:07:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 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 81 [2024-10-11 05:07:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:17,363 INFO L225 Difference]: With dead ends: 3881 [2024-10-11 05:07:17,363 INFO L226 Difference]: Without dead ends: 2396 [2024-10-11 05:07:17,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-11 05:07:17,369 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 2205 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:17,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2246 Valid, 1786 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:07:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-11 05:07:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2232. [2024-10-11 05:07:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 1733 states have (on average 1.315060588574726) internal successors, (2279), 1762 states have internal predecessors, (2279), 267 states have call successors, (267), 169 states have call predecessors, (267), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2024-10-11 05:07:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 2913 transitions. [2024-10-11 05:07:17,586 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 2913 transitions. Word has length 81 [2024-10-11 05:07:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:17,586 INFO L471 AbstractCegarLoop]: Abstraction has 2232 states and 2913 transitions. [2024-10-11 05:07:17,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 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-11 05:07:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2913 transitions. [2024-10-11 05:07:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:07:17,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:17,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 05:07:17,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:07:17,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:17,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1763909525, now seen corresponding path program 1 times [2024-10-11 05:07:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453381769] [2024-10-11 05:07:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:07:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:07:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 05:07:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:07:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 05:07:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:07:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:07:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 05:07:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 05:07:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453381769] [2024-10-11 05:07:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453381769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:07:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60856029] [2024-10-11 05:07:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:07:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:07:17,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:07:17,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:07:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:07:17,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:07:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 05:07:18,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:07:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60856029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:18,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:07:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-11 05:07:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938832265] [2024-10-11 05:07:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:18,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:07:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:07:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:18,070 INFO L87 Difference]: Start difference. First operand 2232 states and 2913 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:07:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:18,447 INFO L93 Difference]: Finished difference Result 5828 states and 7412 transitions. [2024-10-11 05:07:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:07:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-10-11 05:07:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:18,468 INFO L225 Difference]: With dead ends: 5828 [2024-10-11 05:07:18,469 INFO L226 Difference]: Without dead ends: 3982 [2024-10-11 05:07:18,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:18,476 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 57 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:18,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1157 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:07:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2024-10-11 05:07:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3942. [2024-10-11 05:07:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3030 states have (on average 1.2782178217821782) internal successors, (3873), 3082 states have internal predecessors, (3873), 474 states have call successors, (474), 330 states have call predecessors, (474), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2024-10-11 05:07:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4982 transitions. [2024-10-11 05:07:18,837 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4982 transitions. Word has length 145 [2024-10-11 05:07:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:18,838 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 4982 transitions. [2024-10-11 05:07:18,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:07:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4982 transitions. [2024-10-11 05:07:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:18,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:18,842 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-11 05:07:18,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:07:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:07:19,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:19,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1791222778, now seen corresponding path program 1 times [2024-10-11 05:07:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:19,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374073993] [2024-10-11 05:07:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,218 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-11 05:07:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374073993] [2024-10-11 05:07:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374073993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:19,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:07:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182904228] [2024-10-11 05:07:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:19,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:07:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:07:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:07:19,220 INFO L87 Difference]: Start difference. First operand 3942 states and 4982 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-11 05:07:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:21,304 INFO L93 Difference]: Finished difference Result 4354 states and 5669 transitions. [2024-10-11 05:07:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:07:21,305 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-11 05:07:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:21,323 INFO L225 Difference]: With dead ends: 4354 [2024-10-11 05:07:21,323 INFO L226 Difference]: Without dead ends: 4052 [2024-10-11 05:07:21,326 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-11 05:07:21,327 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 950 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:21,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 801 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:07:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2024-10-11 05:07:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 3942. [2024-10-11 05:07:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3030 states have (on average 1.277887788778878) internal successors, (3872), 3082 states have internal predecessors, (3872), 474 states have call successors, (474), 330 states have call predecessors, (474), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2024-10-11 05:07:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4981 transitions. [2024-10-11 05:07:22,144 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4981 transitions. Word has length 142 [2024-10-11 05:07:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:22,145 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 4981 transitions. [2024-10-11 05:07:22,145 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-11 05:07:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4981 transitions. [2024-10-11 05:07:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:22,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:22,148 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-11 05:07:22,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:07:22,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1104790916, now seen corresponding path program 1 times [2024-10-11 05:07:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994607786] [2024-10-11 05:07:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,331 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-11 05:07:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994607786] [2024-10-11 05:07:22,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994607786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:22,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:07:22,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241503222] [2024-10-11 05:07:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:22,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:07:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:07:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:07:22,336 INFO L87 Difference]: Start difference. First operand 3942 states and 4981 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-11 05:07:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:24,295 INFO L93 Difference]: Finished difference Result 4346 states and 5652 transitions. [2024-10-11 05:07:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:07:24,296 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-11 05:07:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:24,316 INFO L225 Difference]: With dead ends: 4346 [2024-10-11 05:07:24,316 INFO L226 Difference]: Without dead ends: 4052 [2024-10-11 05:07:24,318 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-11 05:07:24,319 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 941 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:24,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 799 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:07:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2024-10-11 05:07:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 3942. [2024-10-11 05:07:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3030 states have (on average 1.2775577557755775) internal successors, (3871), 3082 states have internal predecessors, (3871), 474 states have call successors, (474), 330 states have call predecessors, (474), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2024-10-11 05:07:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4980 transitions. [2024-10-11 05:07:25,138 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4980 transitions. Word has length 142 [2024-10-11 05:07:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:25,139 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 4980 transitions. [2024-10-11 05:07:25,140 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-11 05:07:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4980 transitions. [2024-10-11 05:07:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:25,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:25,142 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-11 05:07:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:07:25,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1539296514, now seen corresponding path program 1 times [2024-10-11 05:07:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139909007] [2024-10-11 05:07:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,359 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-11 05:07:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139909007] [2024-10-11 05:07:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139909007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:25,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:07:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087164204] [2024-10-11 05:07:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:25,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:07:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:07:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:07:25,362 INFO L87 Difference]: Start difference. First operand 3942 states and 4980 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-11 05:07:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:28,082 INFO L93 Difference]: Finished difference Result 4759 states and 6342 transitions. [2024-10-11 05:07:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:07:28,083 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-11 05:07:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:28,101 INFO L225 Difference]: With dead ends: 4759 [2024-10-11 05:07:28,102 INFO L226 Difference]: Without dead ends: 4468 [2024-10-11 05:07:28,105 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-11 05:07:28,106 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1494 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:28,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1163 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:07:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2024-10-11 05:07:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4247. [2024-10-11 05:07:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 3309 states have (on average 1.308854638863705) internal successors, (4331), 3362 states have internal predecessors, (4331), 493 states have call successors, (493), 336 states have call predecessors, (493), 443 states have return successors, (657), 550 states have call predecessors, (657), 489 states have call successors, (657) [2024-10-11 05:07:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 5481 transitions. [2024-10-11 05:07:29,000 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 5481 transitions. Word has length 142 [2024-10-11 05:07:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:29,000 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 5481 transitions. [2024-10-11 05:07:29,000 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-11 05:07:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 5481 transitions. [2024-10-11 05:07:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:29,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:29,003 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-11 05:07:29,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:07:29,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1029322818, now seen corresponding path program 1 times [2024-10-11 05:07:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:29,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100118769] [2024-10-11 05:07:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,249 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-11 05:07:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100118769] [2024-10-11 05:07:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100118769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:29,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157894490] [2024-10-11 05:07:29,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:29,253 INFO L87 Difference]: Start difference. First operand 4247 states and 5481 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-11 05:07:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:32,876 INFO L93 Difference]: Finished difference Result 5494 states and 7560 transitions. [2024-10-11 05:07:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:32,877 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-11 05:07:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:32,896 INFO L225 Difference]: With dead ends: 5494 [2024-10-11 05:07:32,896 INFO L226 Difference]: Without dead ends: 4898 [2024-10-11 05:07:32,900 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-11 05:07:32,900 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 1519 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3481 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:32,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 2081 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3481 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 05:07:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2024-10-11 05:07:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 4529. [2024-10-11 05:07:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 3565 states have (on average 1.3309957924263676) internal successors, (4745), 3619 states have internal predecessors, (4745), 512 states have call successors, (512), 342 states have call predecessors, (512), 450 states have return successors, (678), 570 states have call predecessors, (678), 508 states have call successors, (678) [2024-10-11 05:07:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 5935 transitions. [2024-10-11 05:07:33,567 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 5935 transitions. Word has length 142 [2024-10-11 05:07:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:33,567 INFO L471 AbstractCegarLoop]: Abstraction has 4529 states and 5935 transitions. [2024-10-11 05:07:33,567 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-11 05:07:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 5935 transitions. [2024-10-11 05:07:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:33,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:33,570 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-11 05:07:33,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:07:33,571 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:33,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1021086080, now seen corresponding path program 1 times [2024-10-11 05:07:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564854524] [2024-10-11 05:07:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,819 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-11 05:07:33,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:33,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564854524] [2024-10-11 05:07:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564854524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:33,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:33,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237467934] [2024-10-11 05:07:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:33,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:33,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:33,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:33,822 INFO L87 Difference]: Start difference. First operand 4529 states and 5935 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-11 05:07:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:37,721 INFO L93 Difference]: Finished difference Result 6571 states and 9334 transitions. [2024-10-11 05:07:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:37,722 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-11 05:07:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:37,746 INFO L225 Difference]: With dead ends: 6571 [2024-10-11 05:07:37,746 INFO L226 Difference]: Without dead ends: 5693 [2024-10-11 05:07:37,751 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-11 05:07:37,752 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1517 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:37,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 2079 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 05:07:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2024-10-11 05:07:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5094. [2024-10-11 05:07:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5094 states, 4078 states have (on average 1.3668464933791074) internal successors, (5574), 4134 states have internal predecessors, (5574), 550 states have call successors, (550), 354 states have call predecessors, (550), 464 states have return successors, (724), 610 states have call predecessors, (724), 546 states have call successors, (724) [2024-10-11 05:07:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5094 states to 5094 states and 6848 transitions. [2024-10-11 05:07:38,501 INFO L78 Accepts]: Start accepts. Automaton has 5094 states and 6848 transitions. Word has length 142 [2024-10-11 05:07:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:38,502 INFO L471 AbstractCegarLoop]: Abstraction has 5094 states and 6848 transitions. [2024-10-11 05:07:38,503 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-11 05:07:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5094 states and 6848 transitions. [2024-10-11 05:07:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:38,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:38,506 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-11 05:07:38,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:07:38,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:38,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash -533038974, now seen corresponding path program 1 times [2024-10-11 05:07:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:38,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546150599] [2024-10-11 05:07:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,724 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-11 05:07:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546150599] [2024-10-11 05:07:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546150599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:38,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836164975] [2024-10-11 05:07:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:38,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:38,726 INFO L87 Difference]: Start difference. First operand 5094 states and 6848 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-11 05:07:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:42,482 INFO L93 Difference]: Finished difference Result 8636 states and 12719 transitions. [2024-10-11 05:07:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:42,482 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-11 05:07:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:42,516 INFO L225 Difference]: With dead ends: 8636 [2024-10-11 05:07:42,516 INFO L226 Difference]: Without dead ends: 7193 [2024-10-11 05:07:42,526 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-11 05:07:42,527 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1513 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3468 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 3571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:42,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2079 Invalid, 3571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3468 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 05:07:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7193 states. [2024-10-11 05:07:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7193 to 6225. [2024-10-11 05:07:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6225 states, 5105 states have (on average 1.4166503428011754) internal successors, (7232), 5165 states have internal predecessors, (7232), 626 states have call successors, (626), 378 states have call predecessors, (626), 492 states have return successors, (822), 690 states have call predecessors, (822), 622 states have call successors, (822) [2024-10-11 05:07:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 8680 transitions. [2024-10-11 05:07:43,500 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 8680 transitions. Word has length 142 [2024-10-11 05:07:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:43,500 INFO L471 AbstractCegarLoop]: Abstraction has 6225 states and 8680 transitions. [2024-10-11 05:07:43,500 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-11 05:07:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 8680 transitions. [2024-10-11 05:07:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:43,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:43,504 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-11 05:07:43,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:07:43,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1625674176, now seen corresponding path program 1 times [2024-10-11 05:07:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179480404] [2024-10-11 05:07:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:43,733 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-11 05:07:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179480404] [2024-10-11 05:07:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179480404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011028060] [2024-10-11 05:07:43,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:43,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:43,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:43,736 INFO L87 Difference]: Start difference. First operand 6225 states and 8680 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-11 05:07:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:47,354 INFO L93 Difference]: Finished difference Result 12765 states and 19505 transitions. [2024-10-11 05:07:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:47,355 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-11 05:07:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:47,398 INFO L225 Difference]: With dead ends: 12765 [2024-10-11 05:07:47,399 INFO L226 Difference]: Without dead ends: 10191 [2024-10-11 05:07:47,411 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-11 05:07:47,412 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1509 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3459 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:47,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 2079 Invalid, 3562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3459 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:07:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10191 states. [2024-10-11 05:07:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10191 to 8492. [2024-10-11 05:07:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8492 states, 7164 states have (on average 1.4731993299832495) internal successors, (10554), 7232 states have internal predecessors, (10554), 778 states have call successors, (778), 426 states have call predecessors, (778), 548 states have return successors, (1036), 850 states have call predecessors, (1036), 774 states have call successors, (1036) [2024-10-11 05:07:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8492 states to 8492 states and 12368 transitions. [2024-10-11 05:07:48,766 INFO L78 Accepts]: Start accepts. Automaton has 8492 states and 12368 transitions. Word has length 142 [2024-10-11 05:07:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:48,766 INFO L471 AbstractCegarLoop]: Abstraction has 8492 states and 12368 transitions. [2024-10-11 05:07:48,766 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-11 05:07:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8492 states and 12368 transitions. [2024-10-11 05:07:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:48,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:48,771 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-11 05:07:48,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:07:48,771 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:48,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:48,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1387120834, now seen corresponding path program 1 times [2024-10-11 05:07:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062160930] [2024-10-11 05:07:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:48,998 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-11 05:07:48,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:48,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062160930] [2024-10-11 05:07:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062160930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:48,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016630910] [2024-10-11 05:07:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:48,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:49,000 INFO L87 Difference]: Start difference. First operand 8492 states and 12368 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-11 05:07:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:52,866 INFO L93 Difference]: Finished difference Result 21022 states and 33135 transitions. [2024-10-11 05:07:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:52,866 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-11 05:07:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:52,921 INFO L225 Difference]: With dead ends: 21022 [2024-10-11 05:07:52,921 INFO L226 Difference]: Without dead ends: 16181 [2024-10-11 05:07:52,943 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-11 05:07:52,944 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1511 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3445 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:52,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 2079 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3445 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:07:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16181 states. [2024-10-11 05:07:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16181 to 13039. [2024-10-11 05:07:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13039 states, 11295 states have (on average 1.524214254094732) internal successors, (17216), 11379 states have internal predecessors, (17216), 1082 states have call successors, (1082), 522 states have call predecessors, (1082), 660 states have return successors, (1518), 1170 states have call predecessors, (1518), 1078 states have call successors, (1518) [2024-10-11 05:07:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13039 states to 13039 states and 19816 transitions. [2024-10-11 05:07:54,268 INFO L78 Accepts]: Start accepts. Automaton has 13039 states and 19816 transitions. Word has length 142 [2024-10-11 05:07:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:54,269 INFO L471 AbstractCegarLoop]: Abstraction has 13039 states and 19816 transitions. [2024-10-11 05:07:54,269 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-11 05:07:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 13039 states and 19816 transitions. [2024-10-11 05:07:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:07:54,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:54,277 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-11 05:07:54,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:07:54,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:54,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash -455354880, now seen corresponding path program 1 times [2024-10-11 05:07:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491856288] [2024-10-11 05:07:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:07:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:07:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:07:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,488 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-11 05:07:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491856288] [2024-10-11 05:07:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491856288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802702236] [2024-10-11 05:07:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:54,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:54,491 INFO L87 Difference]: Start difference. First operand 13039 states and 19816 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-11 05:07:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:58,835 INFO L93 Difference]: Finished difference Result 37504 states and 60525 transitions. [2024-10-11 05:07:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:58,836 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-11 05:07:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:59,021 INFO L225 Difference]: With dead ends: 37504 [2024-10-11 05:07:59,021 INFO L226 Difference]: Without dead ends: 28116 [2024-10-11 05:07:59,051 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-11 05:07:59,051 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1605 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:59,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 1436 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:07:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28116 states. [2024-10-11 05:08:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28116 to 22195. [2024-10-11 05:08:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22195 states, 19619 states have (on average 1.5621591314542025) internal successors, (30648), 19735 states have internal predecessors, (30648), 1690 states have call successors, (1690), 714 states have call predecessors, (1690), 884 states have return successors, (2644), 1810 states have call predecessors, (2644), 1686 states have call successors, (2644) [2024-10-11 05:08:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22195 states to 22195 states and 34982 transitions. [2024-10-11 05:08:00,748 INFO L78 Accepts]: Start accepts. Automaton has 22195 states and 34982 transitions. Word has length 142 [2024-10-11 05:08:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:08:00,748 INFO L471 AbstractCegarLoop]: Abstraction has 22195 states and 34982 transitions. [2024-10-11 05:08:00,749 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-11 05:08:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22195 states and 34982 transitions. [2024-10-11 05:08:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:08:00,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:08:00,762 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-11 05:08:00,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:08:00,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:08:00,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:08:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash -787998018, now seen corresponding path program 1 times [2024-10-11 05:08:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:08:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755169518] [2024-10-11 05:08:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:08:00,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:08:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:00,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:08:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:08:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:08:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:08:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 05:08:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:00,974 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-11 05:08:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:08:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755169518] [2024-10-11 05:08:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755169518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:08:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:08:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:08:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576490187] [2024-10-11 05:08:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:08:00,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:08:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:08:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:08:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:08:00,980 INFO L87 Difference]: Start difference. First operand 22195 states and 34982 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-11 05:08:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:08:06,926 INFO L93 Difference]: Finished difference Result 70534 states and 116033 transitions. [2024-10-11 05:08:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:08:06,927 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-11 05:08:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:08:07,145 INFO L225 Difference]: With dead ends: 70534 [2024-10-11 05:08:07,146 INFO L226 Difference]: Without dead ends: 51990 [2024-10-11 05:08:07,203 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-11 05:08:07,204 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1506 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:08:07,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 2079 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:08:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51990 states.