./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.09.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.09.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 93c2f95927688290d9634a76e5cb5c078ca9f28d9ebb5a85520405b4d17220b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:06:50,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:06:51,040 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:51,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:06:51,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:06:51,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:06:51,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:06:51,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:06:51,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:06:51,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:06:51,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:06:51,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:06:51,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:06:51,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:06:51,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:06:51,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:06:51,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:06:51,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:06:51,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:06:51,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:06:51,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:06:51,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:06:51,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:06:51,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:06:51,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:06:51,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:06:51,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:06:51,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:06:51,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:06:51,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:06:51,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:06:51,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:06:51,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:51,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:06:51,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:06:51,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:06:51,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:06:51,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:06:51,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:06:51,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:06:51,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:06:51,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:06:51,094 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 -> 93c2f95927688290d9634a76e5cb5c078ca9f28d9ebb5a85520405b4d17220b1 [2024-10-11 05:06:51,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:06:51,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:06:51,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:06:51,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:06:51,381 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:06:51,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2024-10-11 05:06:52,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:06:53,090 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:06:53,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2024-10-11 05:06:53,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b89619db1/87b9799f57284ca68dab359d2139ee88/FLAGbddb6446d [2024-10-11 05:06:53,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b89619db1/87b9799f57284ca68dab359d2139ee88 [2024-10-11 05:06:53,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:06:53,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:06:53,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:53,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:06:53,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:06:53,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:53" (1/1) ... [2024-10-11 05:06:53,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1757ec2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:53, skipping insertion in model container [2024-10-11 05:06:53,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:53" (1/1) ... [2024-10-11 05:06:53,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:06:53,368 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.09.cil-1.c[911,924] [2024-10-11 05:06:53,438 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.09.cil-1.c[8416,8429] [2024-10-11 05:06:53,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:53,530 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:06:53,541 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.09.cil-1.c[911,924] [2024-10-11 05:06:53,575 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.09.cil-1.c[8416,8429] [2024-10-11 05:06:53,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:53,662 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:06:53,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:53 WrapperNode [2024-10-11 05:06:53,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:53,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:53,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:06:53,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:06:53,697 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:53" (1/1) ... [2024-10-11 05:06:53,742 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:53" (1/1) ... [2024-10-11 05:06:53,817 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 926 [2024-10-11 05:06:53,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:53,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:06:53,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:06:53,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:06:53,836 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:53" (1/1) ... [2024-10-11 05:06:53,836 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:53" (1/1) ... [2024-10-11 05:06:53,841 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:53" (1/1) ... [2024-10-11 05:06:53,868 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:53,869 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:53" (1/1) ... [2024-10-11 05:06:53,869 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:53" (1/1) ... [2024-10-11 05:06:53,885 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:53" (1/1) ... [2024-10-11 05:06:53,896 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:53" (1/1) ... [2024-10-11 05:06:53,904 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:53" (1/1) ... [2024-10-11 05:06:53,909 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:53" (1/1) ... [2024-10-11 05:06:53,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:06:53,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:06:53,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:06:53,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:06:53,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:53" (1/1) ... [2024-10-11 05:06:53,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:53,960 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:53,966 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:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:06:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:06:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:06:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:06:54,021 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:06:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:06:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:06:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:06:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:06:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:06:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:06:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:06:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:06:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:06:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:06:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:06:54,024 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:06:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:06:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:06:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:06:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:06:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:06:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:06:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:06:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:06:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:06:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:06:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:06:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:06:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:06:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:06:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:06:54,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:06:54,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:06:54,961 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:06:54,961 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:55,137 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-10-11 05:06:55,138 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:06:55,273 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:06:55,274 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 05:06:55,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:55 BoogieIcfgContainer [2024-10-11 05:06:55,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:06:55,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:06:55,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:06:55,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:06:55,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:06:53" (1/3) ... [2024-10-11 05:06:55,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df6f50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:55, skipping insertion in model container [2024-10-11 05:06:55,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:53" (2/3) ... [2024-10-11 05:06:55,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df6f50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:55, skipping insertion in model container [2024-10-11 05:06:55,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:55" (3/3) ... [2024-10-11 05:06:55,290 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-1.c [2024-10-11 05:06:55,307 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:06:55,308 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:06:55,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:06:55,409 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;@4a07ebc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:06:55,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:06:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 383 states, 327 states have (on average 1.7033639143730888) internal successors, (557), 333 states have internal predecessors, (557), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 05:06:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:55,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:55,429 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:55,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:55,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1286206557, now seen corresponding path program 1 times [2024-10-11 05:06:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889102910] [2024-10-11 05:06:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:55,816 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:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:55,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889102910] [2024-10-11 05:06:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889102910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833094805] [2024-10-11 05:06:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:55,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:55,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:55,849 INFO L87 Difference]: Start difference. First operand has 383 states, 327 states have (on average 1.7033639143730888) internal successors, (557), 333 states have internal predecessors, (557), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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:06:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:57,013 INFO L93 Difference]: Finished difference Result 763 states and 1261 transitions. [2024-10-11 05:06:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:06:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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 57 [2024-10-11 05:06:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:57,033 INFO L225 Difference]: With dead ends: 763 [2024-10-11 05:06:57,033 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 05:06:57,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:06:57,046 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 629 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:57,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1215 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 05:06:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 378. [2024-10-11 05:06:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 324 states have (on average 1.595679012345679) internal successors, (517), 328 states have internal predecessors, (517), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 05:06:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 593 transitions. [2024-10-11 05:06:57,136 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 593 transitions. Word has length 57 [2024-10-11 05:06:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:57,137 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 593 transitions. [2024-10-11 05:06:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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:06:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 593 transitions. [2024-10-11 05:06:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:57,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:57,140 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:57,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:06:57,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -805126299, now seen corresponding path program 1 times [2024-10-11 05:06:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402989271] [2024-10-11 05:06:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:57,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:57,463 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:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402989271] [2024-10-11 05:06:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402989271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:57,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:57,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133323095] [2024-10-11 05:06:57,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:57,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:57,473 INFO L87 Difference]: Start difference. First operand 378 states and 593 transitions. 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:06:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:58,790 INFO L93 Difference]: Finished difference Result 610 states and 939 transitions. [2024-10-11 05:06:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:58,791 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:06:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:58,799 INFO L225 Difference]: With dead ends: 610 [2024-10-11 05:06:58,800 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 05:06:58,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:58,804 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 753 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:58,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1745 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:06:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 05:06:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 479. [2024-10-11 05:06:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 403 states have (on average 1.5682382133995036) internal successors, (632), 409 states have internal predecessors, (632), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 05:06:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 739 transitions. [2024-10-11 05:06:58,863 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 739 transitions. Word has length 57 [2024-10-11 05:06:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:58,864 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 739 transitions. [2024-10-11 05:06:58,864 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:06:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 739 transitions. [2024-10-11 05:06:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:58,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:58,869 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,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:06:58,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:58,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1545848229, now seen corresponding path program 1 times [2024-10-11 05:06:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895699302] [2024-10-11 05:06:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:59,118 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,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895699302] [2024-10-11 05:06:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895699302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:59,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:59,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643712305] [2024-10-11 05:06:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:59,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:59,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:59,122 INFO L87 Difference]: Start difference. First operand 479 states and 739 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:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:00,541 INFO L93 Difference]: Finished difference Result 840 states and 1268 transitions. [2024-10-11 05:07:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:07:00,542 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:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:00,548 INFO L225 Difference]: With dead ends: 840 [2024-10-11 05:07:00,548 INFO L226 Difference]: Without dead ends: 652 [2024-10-11 05:07:00,549 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:00,550 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1173 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:00,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1633 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:07:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-10-11 05:07:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 580. [2024-10-11 05:07:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 482 states have (on average 1.5477178423236515) internal successors, (746), 490 states have internal predecessors, (746), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2024-10-11 05:07:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 887 transitions. [2024-10-11 05:07:00,605 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 887 transitions. Word has length 57 [2024-10-11 05:07:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 887 transitions. [2024-10-11 05:07:00,605 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:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 887 transitions. [2024-10-11 05:07:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:07:00,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:00,608 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,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:07:00,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1855632729, now seen corresponding path program 1 times [2024-10-11 05:07:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776001725] [2024-10-11 05:07:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:07:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:07:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:00,765 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:00,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:00,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776001725] [2024-10-11 05:07:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776001725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:00,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:00,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:07:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120111438] [2024-10-11 05:07:00,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:07:00,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:00,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:07:00,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:07:00,768 INFO L87 Difference]: Start difference. First operand 580 states and 887 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:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:02,942 INFO L93 Difference]: Finished difference Result 1978 states and 2936 transitions. [2024-10-11 05:07:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:07:02,943 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:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:02,951 INFO L225 Difference]: With dead ends: 1978 [2024-10-11 05:07:02,951 INFO L226 Difference]: Without dead ends: 1677 [2024-10-11 05:07:02,953 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:02,954 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 3547 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3569 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:02,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3569 Valid, 1763 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:07:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2024-10-11 05:07:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1544. [2024-10-11 05:07:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1241 states have (on average 1.4528605962933119) internal successors, (1803), 1264 states have internal predecessors, (1803), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2024-10-11 05:07:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2187 transitions. [2024-10-11 05:07:03,079 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2187 transitions. Word has length 57 [2024-10-11 05:07:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:03,079 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2187 transitions. [2024-10-11 05:07:03,080 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:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2187 transitions. [2024-10-11 05:07:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:07:03,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:03,082 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:03,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:07:03,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -400823228, now seen corresponding path program 1 times [2024-10-11 05:07:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271484198] [2024-10-11 05:07:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:07:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,243 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,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:03,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271484198] [2024-10-11 05:07:03,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271484198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:03,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:03,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360472934] [2024-10-11 05:07:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:03,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:03,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:03,245 INFO L87 Difference]: Start difference. First operand 1544 states and 2187 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:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:04,581 INFO L93 Difference]: Finished difference Result 2925 states and 4111 transitions. [2024-10-11 05:07:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:07:04,581 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:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:04,589 INFO L225 Difference]: With dead ends: 2925 [2024-10-11 05:07:04,590 INFO L226 Difference]: Without dead ends: 1666 [2024-10-11 05:07:04,592 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:04,593 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 765 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:04,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1853 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:07:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-10-11 05:07:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1576. [2024-10-11 05:07:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1265 states have (on average 1.4395256916996046) internal successors, (1821), 1288 states have internal predecessors, (1821), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2024-10-11 05:07:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2213 transitions. [2024-10-11 05:07:04,703 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2213 transitions. Word has length 58 [2024-10-11 05:07:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:04,703 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2213 transitions. [2024-10-11 05:07:04,703 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:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2213 transitions. [2024-10-11 05:07:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:07:04,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:04,705 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:04,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:07:04,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:04,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash -473209786, now seen corresponding path program 1 times [2024-10-11 05:07:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281950745] [2024-10-11 05:07:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:07:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:04,835 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:04,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:04,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281950745] [2024-10-11 05:07:04,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281950745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:04,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:04,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:07:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854387225] [2024-10-11 05:07:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:07:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:07:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:07:04,837 INFO L87 Difference]: Start difference. First operand 1576 states and 2213 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:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:07,038 INFO L93 Difference]: Finished difference Result 4835 states and 6774 transitions. [2024-10-11 05:07:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:07:07,039 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:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:07,050 INFO L225 Difference]: With dead ends: 4835 [2024-10-11 05:07:07,051 INFO L226 Difference]: Without dead ends: 1946 [2024-10-11 05:07:07,061 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:07,063 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 3274 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:07,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3296 Valid, 2114 Invalid, 2506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:07:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2024-10-11 05:07:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1790. [2024-10-11 05:07:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1407 states have (on average 1.3859275053304905) internal successors, (1950), 1432 states have internal predecessors, (1950), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2024-10-11 05:07:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2428 transitions. [2024-10-11 05:07:07,264 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2428 transitions. Word has length 58 [2024-10-11 05:07:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2428 transitions. [2024-10-11 05:07:07,266 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:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2428 transitions. [2024-10-11 05:07:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:07,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:07,269 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:07,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:07:07,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2132321001, now seen corresponding path program 1 times [2024-10-11 05:07:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795394165] [2024-10-11 05:07:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:07,445 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:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795394165] [2024-10-11 05:07:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795394165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172155154] [2024-10-11 05:07:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:07,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:07,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:07,449 INFO L87 Difference]: Start difference. First operand 1790 states and 2428 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:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:08,558 INFO L93 Difference]: Finished difference Result 3459 states and 4666 transitions. [2024-10-11 05:07:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:07:08,558 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:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:08,569 INFO L225 Difference]: With dead ends: 3459 [2024-10-11 05:07:08,570 INFO L226 Difference]: Without dead ends: 1954 [2024-10-11 05:07:08,574 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:08,577 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 508 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:08,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 2053 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:07:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2024-10-11 05:07:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1838. [2024-10-11 05:07:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1443 states have (on average 1.3721413721413722) internal successors, (1980), 1468 states have internal predecessors, (1980), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2024-10-11 05:07:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2470 transitions. [2024-10-11 05:07:08,754 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2470 transitions. Word has length 80 [2024-10-11 05:07:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:08,755 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2470 transitions. [2024-10-11 05:07:08,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:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2470 transitions. [2024-10-11 05:07:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:08,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:08,757 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:08,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:07:08,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:08,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash -234373593, now seen corresponding path program 1 times [2024-10-11 05:07:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472794766] [2024-10-11 05:07:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,914 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:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472794766] [2024-10-11 05:07:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472794766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:08,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765035483] [2024-10-11 05:07:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:08,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:08,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:08,916 INFO L87 Difference]: Start difference. First operand 1838 states and 2470 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:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:09,888 INFO L93 Difference]: Finished difference Result 5157 states and 6900 transitions. [2024-10-11 05:07:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:07:09,889 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:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:09,911 INFO L225 Difference]: With dead ends: 5157 [2024-10-11 05:07:09,911 INFO L226 Difference]: Without dead ends: 3605 [2024-10-11 05:07:09,916 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:09,918 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1377 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:09,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 1037 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:07:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2024-10-11 05:07:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3389. [2024-10-11 05:07:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 2621 states have (on average 1.3281190385349104) internal successors, (3481), 2680 states have internal predecessors, (3481), 404 states have call successors, (404), 271 states have call predecessors, (404), 362 states have return successors, (607), 442 states have call predecessors, (607), 402 states have call successors, (607) [2024-10-11 05:07:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4492 transitions. [2024-10-11 05:07:10,262 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4492 transitions. Word has length 80 [2024-10-11 05:07:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 3389 states and 4492 transitions. [2024-10-11 05:07:10,263 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:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4492 transitions. [2024-10-11 05:07:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:10,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:10,265 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,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:07:10,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:10,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash -157472795, now seen corresponding path program 1 times [2024-10-11 05:07:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:10,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801148723] [2024-10-11 05:07:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:10,308 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 15 [2024-10-11 05:07:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,334 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,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801148723] [2024-10-11 05:07:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801148723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:07:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890237158] [2024-10-11 05:07:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:10,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:07:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:07:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:07:10,337 INFO L87 Difference]: Start difference. First operand 3389 states and 4492 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:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:11,045 INFO L93 Difference]: Finished difference Result 5057 states and 6620 transitions. [2024-10-11 05:07:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:07:11,046 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:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:11,059 INFO L225 Difference]: With dead ends: 5057 [2024-10-11 05:07:11,060 INFO L226 Difference]: Without dead ends: 1954 [2024-10-11 05:07:11,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:11,069 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 624 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:11,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1179 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:07:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2024-10-11 05:07:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1838. [2024-10-11 05:07:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1443 states have (on average 1.3423423423423424) internal successors, (1937), 1468 states have internal predecessors, (1937), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2024-10-11 05:07:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2427 transitions. [2024-10-11 05:07:11,238 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2427 transitions. Word has length 80 [2024-10-11 05:07:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:11,238 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2427 transitions. [2024-10-11 05:07:11,239 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:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2427 transitions. [2024-10-11 05:07:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 05:07:11,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:11,240 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:11,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:07:11,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:11,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 591136919, now seen corresponding path program 1 times [2024-10-11 05:07:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595445309] [2024-10-11 05:07:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:07:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,383 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:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595445309] [2024-10-11 05:07:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595445309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:11,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382840006] [2024-10-11 05:07:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:11,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:11,385 INFO L87 Difference]: Start difference. First operand 1838 states and 2427 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:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:12,946 INFO L93 Difference]: Finished difference Result 4281 states and 5604 transitions. [2024-10-11 05:07:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 05:07:12,947 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:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:12,963 INFO L225 Difference]: With dead ends: 4281 [2024-10-11 05:07:12,964 INFO L226 Difference]: Without dead ends: 2587 [2024-10-11 05:07:12,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-11 05:07:12,970 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1755 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:12,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 1871 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:07:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2024-10-11 05:07:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2423. [2024-10-11 05:07:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 1869 states have (on average 1.3001605136436598) internal successors, (2430), 1903 states have internal predecessors, (2430), 294 states have call successors, (294), 188 states have call predecessors, (294), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) [2024-10-11 05:07:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3135 transitions. [2024-10-11 05:07:13,233 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3135 transitions. Word has length 81 [2024-10-11 05:07:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 3135 transitions. [2024-10-11 05:07:13,234 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:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3135 transitions. [2024-10-11 05:07:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:13,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:13,237 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] [2024-10-11 05:07:13,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:07:13,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:13,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2048753316, now seen corresponding path program 1 times [2024-10-11 05:07:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:13,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809113264] [2024-10-11 05:07:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,384 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:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809113264] [2024-10-11 05:07:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809113264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:07:13,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845703530] [2024-10-11 05:07:13,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:13,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:07:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:07:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:07:13,387 INFO L87 Difference]: Start difference. First operand 2423 states and 3135 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:15,132 INFO L93 Difference]: Finished difference Result 2789 states and 3741 transitions. [2024-10-11 05:07:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:07:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:15,146 INFO L225 Difference]: With dead ends: 2789 [2024-10-11 05:07:15,146 INFO L226 Difference]: Without dead ends: 2523 [2024-10-11 05:07:15,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:15,149 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 859 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:15,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 731 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:07:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-10-11 05:07:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2423. [2024-10-11 05:07:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 1869 states have (on average 1.299625468164794) internal successors, (2429), 1903 states have internal predecessors, (2429), 294 states have call successors, (294), 188 states have call predecessors, (294), 258 states have return successors, (411), 334 states have call predecessors, (411), 292 states have call successors, (411) [2024-10-11 05:07:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3134 transitions. [2024-10-11 05:07:15,674 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3134 transitions. Word has length 131 [2024-10-11 05:07:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:15,674 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 3134 transitions. [2024-10-11 05:07:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3134 transitions. [2024-10-11 05:07:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:15,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:15,678 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] [2024-10-11 05:07:15,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:07:15,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:15,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash -403738266, now seen corresponding path program 1 times [2024-10-11 05:07:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:15,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853455552] [2024-10-11 05:07:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,909 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:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853455552] [2024-10-11 05:07:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853455552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:15,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:07:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580376561] [2024-10-11 05:07:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:15,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:07:15,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:07:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:07:15,912 INFO L87 Difference]: Start difference. First operand 2423 states and 3134 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:18,370 INFO L93 Difference]: Finished difference Result 3160 states and 4358 transitions. [2024-10-11 05:07:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:07:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:18,383 INFO L225 Difference]: With dead ends: 3160 [2024-10-11 05:07:18,383 INFO L226 Difference]: Without dead ends: 2898 [2024-10-11 05:07:18,385 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:18,386 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1370 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:18,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1165 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:07:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2024-10-11 05:07:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2699. [2024-10-11 05:07:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2120 states have (on average 1.3396226415094339) internal successors, (2840), 2155 states have internal predecessors, (2840), 312 states have call successors, (312), 194 states have call predecessors, (312), 265 states have return successors, (432), 352 states have call predecessors, (432), 310 states have call successors, (432) [2024-10-11 05:07:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3584 transitions. [2024-10-11 05:07:18,896 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3584 transitions. Word has length 131 [2024-10-11 05:07:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 3584 transitions. [2024-10-11 05:07:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3584 transitions. [2024-10-11 05:07:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:18,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:18,900 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] [2024-10-11 05:07:18,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:07:18,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:18,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1982938218, now seen corresponding path program 1 times [2024-10-11 05:07:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719612780] [2024-10-11 05:07:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:19,152 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,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719612780] [2024-10-11 05:07:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719612780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960716979] [2024-10-11 05:07:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:19,160 INFO L87 Difference]: Start difference. First operand 2699 states and 3584 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:22,331 INFO L93 Difference]: Finished difference Result 3825 states and 5452 transitions. [2024-10-11 05:07:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:22,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:22,347 INFO L225 Difference]: With dead ends: 3825 [2024-10-11 05:07:22,348 INFO L226 Difference]: Without dead ends: 3287 [2024-10-11 05:07:22,350 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:22,351 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1393 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3195 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:22,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1845 Invalid, 3290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3195 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:07:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2024-10-11 05:07:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 2954. [2024-10-11 05:07:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2350 states have (on average 1.365531914893617) internal successors, (3209), 2386 states have internal predecessors, (3209), 330 states have call successors, (330), 200 states have call predecessors, (330), 272 states have return successors, (452), 371 states have call predecessors, (452), 328 states have call successors, (452) [2024-10-11 05:07:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3991 transitions. [2024-10-11 05:07:22,799 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3991 transitions. Word has length 131 [2024-10-11 05:07:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3991 transitions. [2024-10-11 05:07:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3991 transitions. [2024-10-11 05:07:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:22,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:22,803 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] [2024-10-11 05:07:22,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:07:22,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:22,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1840672728, now seen corresponding path program 1 times [2024-10-11 05:07:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804296836] [2024-10-11 05:07:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:23,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:23,033 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:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804296836] [2024-10-11 05:07:23,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804296836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:23,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778120808] [2024-10-11 05:07:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:23,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:23,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:23,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:23,035 INFO L87 Difference]: Start difference. First operand 2954 states and 3991 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:26,146 INFO L93 Difference]: Finished difference Result 4799 states and 7045 transitions. [2024-10-11 05:07:26,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:26,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:26,174 INFO L225 Difference]: With dead ends: 4799 [2024-10-11 05:07:26,174 INFO L226 Difference]: Without dead ends: 4006 [2024-10-11 05:07:26,181 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:26,182 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1391 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:26,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 1843 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2024-10-11 05:07:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 3465. [2024-10-11 05:07:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 2811 states have (on average 1.4044823906083244) internal successors, (3948), 2849 states have internal predecessors, (3948), 366 states have call successors, (366), 212 states have call predecessors, (366), 286 states have return successors, (496), 409 states have call predecessors, (496), 364 states have call successors, (496) [2024-10-11 05:07:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4810 transitions. [2024-10-11 05:07:26,664 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4810 transitions. Word has length 131 [2024-10-11 05:07:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:26,664 INFO L471 AbstractCegarLoop]: Abstraction has 3465 states and 4810 transitions. [2024-10-11 05:07:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4810 transitions. [2024-10-11 05:07:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:26,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:26,668 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] [2024-10-11 05:07:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:07:26,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:26,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash 806931626, now seen corresponding path program 1 times [2024-10-11 05:07:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701769414] [2024-10-11 05:07:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:26,909 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:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701769414] [2024-10-11 05:07:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701769414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:26,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739089972] [2024-10-11 05:07:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:26,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:26,911 INFO L87 Difference]: Start difference. First operand 3465 states and 4810 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:29,912 INFO L93 Difference]: Finished difference Result 6666 states and 10084 transitions. [2024-10-11 05:07:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:29,938 INFO L225 Difference]: With dead ends: 6666 [2024-10-11 05:07:29,938 INFO L226 Difference]: Without dead ends: 5362 [2024-10-11 05:07:29,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:29,946 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1387 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3182 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:29,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1843 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3182 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2024-10-11 05:07:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4488. [2024-10-11 05:07:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4488 states, 3734 states have (on average 1.4531333690412427) internal successors, (5426), 3776 states have internal predecessors, (5426), 438 states have call successors, (438), 236 states have call predecessors, (438), 314 states have return successors, (590), 485 states have call predecessors, (590), 436 states have call successors, (590) [2024-10-11 05:07:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6454 transitions. [2024-10-11 05:07:30,687 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6454 transitions. Word has length 131 [2024-10-11 05:07:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:30,688 INFO L471 AbstractCegarLoop]: Abstraction has 4488 states and 6454 transitions. [2024-10-11 05:07:30,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6454 transitions. [2024-10-11 05:07:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:30,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:30,692 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] [2024-10-11 05:07:30,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:07:30,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1324419096, now seen corresponding path program 1 times [2024-10-11 05:07:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402328257] [2024-10-11 05:07:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:30,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:30,895 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:30,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:30,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402328257] [2024-10-11 05:07:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402328257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516017202] [2024-10-11 05:07:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:30,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:30,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:30,899 INFO L87 Difference]: Start difference. First operand 4488 states and 6454 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:34,036 INFO L93 Difference]: Finished difference Result 10399 states and 16178 transitions. [2024-10-11 05:07:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:34,068 INFO L225 Difference]: With dead ends: 10399 [2024-10-11 05:07:34,068 INFO L226 Difference]: Without dead ends: 8072 [2024-10-11 05:07:34,078 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:34,079 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1383 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3173 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:34,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 1843 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3173 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8072 states. [2024-10-11 05:07:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8072 to 6539. [2024-10-11 05:07:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 5585 states have (on average 1.501880035810206) internal successors, (8388), 5635 states have internal predecessors, (8388), 582 states have call successors, (582), 284 states have call predecessors, (582), 370 states have return successors, (796), 637 states have call predecessors, (796), 580 states have call successors, (796) [2024-10-11 05:07:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 9766 transitions. [2024-10-11 05:07:34,816 INFO L78 Accepts]: Start accepts. Automaton has 6539 states and 9766 transitions. Word has length 131 [2024-10-11 05:07:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:34,816 INFO L471 AbstractCegarLoop]: Abstraction has 6539 states and 9766 transitions. [2024-10-11 05:07:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 9766 transitions. [2024-10-11 05:07:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:34,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:34,823 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] [2024-10-11 05:07:34,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:07:34,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1931963626, now seen corresponding path program 1 times [2024-10-11 05:07:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750820648] [2024-10-11 05:07:34,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:35,074 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:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750820648] [2024-10-11 05:07:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750820648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111300629] [2024-10-11 05:07:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:35,077 INFO L87 Difference]: Start difference. First operand 6539 states and 9766 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:38,660 INFO L93 Difference]: Finished difference Result 17864 states and 28424 transitions. [2024-10-11 05:07:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:38,711 INFO L225 Difference]: With dead ends: 17864 [2024-10-11 05:07:38,712 INFO L226 Difference]: Without dead ends: 13486 [2024-10-11 05:07:38,728 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:38,729 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1379 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:38,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 1843 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13486 states. [2024-10-11 05:07:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13486 to 10654. [2024-10-11 05:07:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10654 states, 9300 states have (on average 1.5408602150537634) internal successors, (14330), 9366 states have internal predecessors, (14330), 870 states have call successors, (870), 380 states have call predecessors, (870), 482 states have return successors, (1262), 941 states have call predecessors, (1262), 868 states have call successors, (1262) [2024-10-11 05:07:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10654 states to 10654 states and 16462 transitions. [2024-10-11 05:07:39,707 INFO L78 Accepts]: Start accepts. Automaton has 10654 states and 16462 transitions. Word has length 131 [2024-10-11 05:07:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:39,708 INFO L471 AbstractCegarLoop]: Abstraction has 10654 states and 16462 transitions. [2024-10-11 05:07:39,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 10654 states and 16462 transitions. [2024-10-11 05:07:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:39,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:39,717 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] [2024-10-11 05:07:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:07:39,717 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:39,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -41201752, now seen corresponding path program 1 times [2024-10-11 05:07:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041711842] [2024-10-11 05:07:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:39,907 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:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041711842] [2024-10-11 05:07:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041711842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533696647] [2024-10-11 05:07:39,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:39,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:39,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:39,909 INFO L87 Difference]: Start difference. First operand 10654 states and 16462 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:44,026 INFO L93 Difference]: Finished difference Result 32793 states and 53106 transitions. [2024-10-11 05:07:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:44,184 INFO L225 Difference]: With dead ends: 32793 [2024-10-11 05:07:44,184 INFO L226 Difference]: Without dead ends: 24300 [2024-10-11 05:07:44,215 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:44,215 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1381 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3150 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:44,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 1843 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3150 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:07:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24300 states. [2024-10-11 05:07:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24300 to 18913. [2024-10-11 05:07:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18913 states, 16759 states have (on average 1.5666805895339817) internal successors, (26256), 16857 states have internal predecessors, (26256), 1446 states have call successors, (1446), 572 states have call predecessors, (1446), 706 states have return successors, (2356), 1549 states have call predecessors, (2356), 1444 states have call successors, (2356) [2024-10-11 05:07:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18913 states to 18913 states and 30058 transitions. [2024-10-11 05:07:45,680 INFO L78 Accepts]: Start accepts. Automaton has 18913 states and 30058 transitions. Word has length 131 [2024-10-11 05:07:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:45,681 INFO L471 AbstractCegarLoop]: Abstraction has 18913 states and 30058 transitions. [2024-10-11 05:07:45,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 18913 states and 30058 transitions. [2024-10-11 05:07:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:45,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:45,693 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] [2024-10-11 05:07:45,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:07:45,694 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:45,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2111905066, now seen corresponding path program 1 times [2024-10-11 05:07:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667493544] [2024-10-11 05:07:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:45,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:45,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:45,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:45,880 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:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667493544] [2024-10-11 05:07:45,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667493544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:45,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:45,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826466754] [2024-10-11 05:07:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:45,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:45,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:45,882 INFO L87 Difference]: Start difference. First operand 18913 states and 30058 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:51,136 INFO L93 Difference]: Finished difference Result 62587 states and 102944 transitions. [2024-10-11 05:07:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:51,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:07:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:51,331 INFO L225 Difference]: With dead ends: 62587 [2024-10-11 05:07:51,331 INFO L226 Difference]: Without dead ends: 45835 [2024-10-11 05:07:51,387 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:51,388 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1377 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3122 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:51,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 1843 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3122 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2024-10-11 05:07:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 35557. [2024-10-11 05:07:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35557 states, 31803 states have (on average 1.5824922177153098) internal successors, (50328), 31965 states have internal predecessors, (50328), 2598 states have call successors, (2598), 956 states have call predecessors, (2598), 1154 states have return successors, (5030), 2765 states have call predecessors, (5030), 2596 states have call successors, (5030) [2024-10-11 05:07:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35557 states to 35557 states and 57956 transitions. [2024-10-11 05:07:54,033 INFO L78 Accepts]: Start accepts. Automaton has 35557 states and 57956 transitions. Word has length 131 [2024-10-11 05:07:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 35557 states and 57956 transitions. [2024-10-11 05:07:54,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 35557 states and 57956 transitions. [2024-10-11 05:07:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:07:54,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:54,057 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] [2024-10-11 05:07:54,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:07:54,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:54,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2064620756, now seen corresponding path program 1 times [2024-10-11 05:07:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132927056] [2024-10-11 05:07:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 05:07:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 05:07:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:07:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:07:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,250 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,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132927056] [2024-10-11 05:07:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132927056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552755159] [2024-10-11 05:07:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:54,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:54,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:54,252 INFO L87 Difference]: Start difference. First operand 35557 states and 57956 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:08:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:08:02,366 INFO L93 Difference]: Finished difference Result 122305 states and 204724 transitions. [2024-10-11 05:08:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:08:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-11 05:08:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:08:02,821 INFO L225 Difference]: With dead ends: 122305 [2024-10-11 05:08:02,821 INFO L226 Difference]: Without dead ends: 88909 [2024-10-11 05:08:03,187 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:03,188 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1376 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:08:03,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1843 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 05:08:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88909 states.