./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:15:44,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:15:44,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:15:44,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:15:44,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:15:44,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:15:44,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:15:44,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:15:44,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:15:44,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:15:44,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:15:44,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:15:44,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:15:44,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:15:44,487 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:15:44,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:15:44,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:15:44,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:15:44,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:15:44,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:15:44,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:15:44,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:15:44,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:15:44,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:15:44,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:15:44,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:15:44,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:15:44,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:15:44,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:15:44,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:15:44,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:15:44,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:15:44,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:15:44,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:15:44,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:15:44,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:15:44,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:15:44,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:15:44,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:15:44,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:15:44,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:15:44,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:15:44,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a [2024-10-14 05:15:44,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:15:44,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:15:44,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:15:44,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:15:44,736 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:15:44,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2024-10-14 05:15:46,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:15:46,371 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:15:46,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2024-10-14 05:15:46,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdd688c1/07e965b9b4e94e2090ee58e7fefe6b95/FLAG37c4fe37b [2024-10-14 05:15:46,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdd688c1/07e965b9b4e94e2090ee58e7fefe6b95 [2024-10-14 05:15:46,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:15:46,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:15:46,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:15:46,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:15:46,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:15:46,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f24c811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46, skipping insertion in model container [2024-10-14 05:15:46,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:15:46,586 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2024-10-14 05:15:46,647 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2024-10-14 05:15:46,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:15:46,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:15:46,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2024-10-14 05:15:46,756 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2024-10-14 05:15:46,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:15:46,814 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:15:46,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46 WrapperNode [2024-10-14 05:15:46,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:15:46,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:15:46,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:15:46,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:15:46,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,878 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 986 [2024-10-14 05:15:46,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:15:46,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:15:46,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:15:46,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:15:46,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 05:15:46,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:15:46,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:15:46,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:15:46,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:15:46,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (1/1) ... [2024-10-14 05:15:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:15:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:15:47,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:15:47,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:15:47,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:15:47,039 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:15:47,039 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:15:47,039 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:15:47,040 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:15:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:15:47,041 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:15:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:15:47,041 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:15:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:15:47,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:15:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:15:47,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:15:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:15:47,041 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:15:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:15:47,042 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:15:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:15:47,042 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:15:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:15:47,042 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:15:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:15:47,043 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:15:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:15:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:15:47,043 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:15:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:15:47,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:15:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:15:47,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:15:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:15:47,044 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:15:47,162 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:15:47,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:15:47,779 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-14 05:15:47,779 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-14 05:15:47,926 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-14 05:15:47,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:15:47,984 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:15:47,984 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-14 05:15:47,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:47 BoogieIcfgContainer [2024-10-14 05:15:47,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:15:47,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:15:47,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:15:47,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:15:47,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:46" (1/3) ... [2024-10-14 05:15:47,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b66e653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:47, skipping insertion in model container [2024-10-14 05:15:47,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:46" (2/3) ... [2024-10-14 05:15:47,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b66e653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:47, skipping insertion in model container [2024-10-14 05:15:47,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:47" (3/3) ... [2024-10-14 05:15:47,991 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-2.c [2024-10-14 05:15:48,003 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:15:48,004 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:15:48,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:15:48,084 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;@c2d6e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:15:48,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:15:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 349 states have (on average 1.7077363896848137) internal successors, (596), 355 states have internal predecessors, (596), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 05:15:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:48,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:48,098 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-14 05:15:48,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:48,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1719685188, now seen corresponding path program 1 times [2024-10-14 05:15:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974817304] [2024-10-14 05:15:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974817304] [2024-10-14 05:15:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974817304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:48,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:15:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443926732] [2024-10-14 05:15:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:48,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:15:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:15:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:15:48,790 INFO L87 Difference]: Start difference. First operand has 406 states, 349 states have (on average 1.7077363896848137) internal successors, (596), 355 states have internal predecessors, (596), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) 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-14 05:15:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:50,255 INFO L93 Difference]: Finished difference Result 927 states and 1533 transitions. [2024-10-14 05:15:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:50,257 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-14 05:15:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:50,275 INFO L225 Difference]: With dead ends: 927 [2024-10-14 05:15:50,276 INFO L226 Difference]: Without dead ends: 539 [2024-10-14 05:15:50,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:50,288 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1100 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:50,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1627 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:15:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-14 05:15:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 502. [2024-10-14 05:15:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 425 states have (on average 1.5788235294117647) internal successors, (671), 431 states have internal predecessors, (671), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2024-10-14 05:15:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 780 transitions. [2024-10-14 05:15:50,362 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 780 transitions. Word has length 57 [2024-10-14 05:15:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:50,362 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 780 transitions. [2024-10-14 05:15:50,362 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-14 05:15:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 780 transitions. [2024-10-14 05:15:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:50,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:50,365 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-14 05:15:50,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:15:50,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:50,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash 631289340, now seen corresponding path program 1 times [2024-10-14 05:15:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:50,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092499780] [2024-10-14 05:15:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092499780] [2024-10-14 05:15:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092499780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:15:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042099478] [2024-10-14 05:15:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:15:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:15:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:15:50,508 INFO L87 Difference]: Start difference. First operand 502 states and 780 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-14 05:15:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:51,635 INFO L93 Difference]: Finished difference Result 863 states and 1310 transitions. [2024-10-14 05:15:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:15:51,635 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-14 05:15:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:51,640 INFO L225 Difference]: With dead ends: 863 [2024-10-14 05:15:51,640 INFO L226 Difference]: Without dead ends: 675 [2024-10-14 05:15:51,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:15:51,642 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 1232 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:51,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 1922 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:15:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-14 05:15:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 603. [2024-10-14 05:15:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 504 states have (on average 1.5595238095238095) internal successors, (786), 512 states have internal predecessors, (786), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2024-10-14 05:15:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 929 transitions. [2024-10-14 05:15:51,682 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 929 transitions. Word has length 57 [2024-10-14 05:15:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 929 transitions. [2024-10-14 05:15:51,682 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-14 05:15:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 929 transitions. [2024-10-14 05:15:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:51,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:51,685 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-14 05:15:51,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:15:51,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:51,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1524775678, now seen corresponding path program 1 times [2024-10-14 05:15:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:51,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898355496] [2024-10-14 05:15:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:51,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898355496] [2024-10-14 05:15:51,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898355496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:51,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:51,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:15:51,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329807793] [2024-10-14 05:15:51,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:51,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:15:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:51,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:15:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:15:51,804 INFO L87 Difference]: Start difference. First operand 603 states and 929 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-14 05:15:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:53,819 INFO L93 Difference]: Finished difference Result 2001 states and 2979 transitions. [2024-10-14 05:15:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:15:53,822 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-14 05:15:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:53,839 INFO L225 Difference]: With dead ends: 2001 [2024-10-14 05:15:53,839 INFO L226 Difference]: Without dead ends: 1700 [2024-10-14 05:15:53,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 05:15:53,848 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 3725 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3743 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:53,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3743 Valid, 1848 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 05:15:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2024-10-14 05:15:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1567. [2024-10-14 05:15:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1263 states have (on average 1.4576405384006335) internal successors, (1841), 1286 states have internal predecessors, (1841), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2024-10-14 05:15:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2227 transitions. [2024-10-14 05:15:54,051 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2227 transitions. Word has length 57 [2024-10-14 05:15:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:54,051 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2227 transitions. [2024-10-14 05:15:54,051 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-14 05:15:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2227 transitions. [2024-10-14 05:15:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:15:54,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:54,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:54,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:15:54,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2014710099, now seen corresponding path program 1 times [2024-10-14 05:15:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355037490] [2024-10-14 05:15:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:15:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:15:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:54,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:54,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355037490] [2024-10-14 05:15:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355037490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092045295] [2024-10-14 05:15:54,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:54,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:54,367 INFO L87 Difference]: Start difference. First operand 1567 states and 2227 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:15:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:56,425 INFO L93 Difference]: Finished difference Result 2948 states and 4151 transitions. [2024-10-14 05:15:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:15:56,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 05:15:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:56,433 INFO L225 Difference]: With dead ends: 2948 [2024-10-14 05:15:56,433 INFO L226 Difference]: Without dead ends: 1689 [2024-10-14 05:15:56,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:15:56,439 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 821 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:56,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1978 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 05:15:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-14 05:15:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1599. [2024-10-14 05:15:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1287 states have (on average 1.4444444444444444) internal successors, (1859), 1310 states have internal predecessors, (1859), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2024-10-14 05:15:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2253 transitions. [2024-10-14 05:15:56,554 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2253 transitions. Word has length 58 [2024-10-14 05:15:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:56,554 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2253 transitions. [2024-10-14 05:15:56,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:15:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2253 transitions. [2024-10-14 05:15:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:15:56,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:56,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:56,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:15:56,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:56,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1942323541, now seen corresponding path program 1 times [2024-10-14 05:15:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754103976] [2024-10-14 05:15:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:15:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:15:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:56,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:56,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754103976] [2024-10-14 05:15:56,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754103976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:56,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:56,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:15:56,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085166280] [2024-10-14 05:15:56,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:56,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:15:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:56,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:15:56,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:15:56,665 INFO L87 Difference]: Start difference. First operand 1599 states and 2253 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-14 05:15:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:58,454 INFO L93 Difference]: Finished difference Result 4858 states and 6814 transitions. [2024-10-14 05:15:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:15:58,455 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-14 05:15:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:58,465 INFO L225 Difference]: With dead ends: 4858 [2024-10-14 05:15:58,465 INFO L226 Difference]: Without dead ends: 1969 [2024-10-14 05:15:58,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 05:15:58,474 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 3430 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3448 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:58,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3448 Valid, 2216 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:15:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-10-14 05:15:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1813. [2024-10-14 05:15:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1429 states have (on average 1.391182645206438) internal successors, (1988), 1454 states have internal predecessors, (1988), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2024-10-14 05:15:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2468 transitions. [2024-10-14 05:15:58,569 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2468 transitions. Word has length 58 [2024-10-14 05:15:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:58,571 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 2468 transitions. [2024-10-14 05:15:58,571 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-14 05:15:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2468 transitions. [2024-10-14 05:15:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:15:58,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:58,573 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-14 05:15:58,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:15:58,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1686434113, now seen corresponding path program 1 times [2024-10-14 05:15:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310779685] [2024-10-14 05:15:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:15:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:15:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:15:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,750 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-14 05:15:58,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:58,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310779685] [2024-10-14 05:15:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310779685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671648240] [2024-10-14 05:15:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:58,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:58,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:58,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:58,757 INFO L87 Difference]: Start difference. First operand 1813 states and 2468 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-14 05:15:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:59,983 INFO L93 Difference]: Finished difference Result 3482 states and 4706 transitions. [2024-10-14 05:15:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:15:59,983 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-14 05:15:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:59,991 INFO L225 Difference]: With dead ends: 3482 [2024-10-14 05:15:59,991 INFO L226 Difference]: Without dead ends: 1977 [2024-10-14 05:15:59,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:59,995 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 548 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:59,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2195 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:15:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-14 05:16:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1861. [2024-10-14 05:16:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1465 states have (on average 1.3774744027303754) internal successors, (2018), 1490 states have internal predecessors, (2018), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2024-10-14 05:16:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2510 transitions. [2024-10-14 05:16:00,116 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2510 transitions. Word has length 80 [2024-10-14 05:16:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:00,117 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 2510 transitions. [2024-10-14 05:16:00,117 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-14 05:16:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2510 transitions. [2024-10-14 05:16:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:00,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:00,118 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-14 05:16:00,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:16:00,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:00,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash 241838589, now seen corresponding path program 1 times [2024-10-14 05:16:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:00,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49564525] [2024-10-14 05:16:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,234 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-14 05:16:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49564525] [2024-10-14 05:16:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49564525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:00,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:00,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:16:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766612811] [2024-10-14 05:16:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:00,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:16:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:00,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:16:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:16:00,236 INFO L87 Difference]: Start difference. First operand 1861 states and 2510 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:16:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:01,263 INFO L93 Difference]: Finished difference Result 3260 states and 4346 transitions. [2024-10-14 05:16:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 05:16:01,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-14 05:16:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:01,271 INFO L225 Difference]: With dead ends: 3260 [2024-10-14 05:16:01,272 INFO L226 Difference]: Without dead ends: 1928 [2024-10-14 05:16:01,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-14 05:16:01,275 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1527 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:01,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1418 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:16:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-10-14 05:16:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1653. [2024-10-14 05:16:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1310 states have (on average 1.383969465648855) internal successors, (1813), 1330 states have internal predecessors, (1813), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2024-10-14 05:16:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2237 transitions. [2024-10-14 05:16:01,356 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2237 transitions. Word has length 80 [2024-10-14 05:16:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:01,356 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2237 transitions. [2024-10-14 05:16:01,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:16:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2237 transitions. [2024-10-14 05:16:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:01,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:01,358 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-14 05:16:01,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:16:01,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:01,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash 665485311, now seen corresponding path program 1 times [2024-10-14 05:16:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112538265] [2024-10-14 05:16:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:01,474 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-14 05:16:01,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112538265] [2024-10-14 05:16:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112538265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:01,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:01,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740050602] [2024-10-14 05:16:01,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:01,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:01,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:01,476 INFO L87 Difference]: Start difference. First operand 1653 states and 2237 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-14 05:16:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:02,333 INFO L93 Difference]: Finished difference Result 4553 states and 6097 transitions. [2024-10-14 05:16:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:16:02,333 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-14 05:16:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:02,344 INFO L225 Difference]: With dead ends: 4553 [2024-10-14 05:16:02,345 INFO L226 Difference]: Without dead ends: 3209 [2024-10-14 05:16:02,347 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-14 05:16:02,348 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1453 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:02,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1194 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:16:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2024-10-14 05:16:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2999. [2024-10-14 05:16:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2336 states have (on average 1.3347602739726028) internal successors, (3118), 2385 states have internal predecessors, (3118), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2024-10-14 05:16:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3986 transitions. [2024-10-14 05:16:02,497 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3986 transitions. Word has length 80 [2024-10-14 05:16:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:02,497 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 3986 transitions. [2024-10-14 05:16:02,497 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-14 05:16:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3986 transitions. [2024-10-14 05:16:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:02,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:02,499 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-14 05:16:02,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:16:02,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 742386109, now seen corresponding path program 1 times [2024-10-14 05:16:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924301809] [2024-10-14 05:16:02,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,557 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-14 05:16:02,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924301809] [2024-10-14 05:16:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924301809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:16:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380352078] [2024-10-14 05:16:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:02,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:16:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:02,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:16:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:16:02,560 INFO L87 Difference]: Start difference. First operand 2999 states and 3986 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-14 05:16:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:03,249 INFO L93 Difference]: Finished difference Result 4456 states and 5843 transitions. [2024-10-14 05:16:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:16:03,250 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-14 05:16:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:03,258 INFO L225 Difference]: With dead ends: 4456 [2024-10-14 05:16:03,258 INFO L226 Difference]: Without dead ends: 1766 [2024-10-14 05:16:03,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:03,264 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 925 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:03,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1020 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:16:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-10-14 05:16:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1653. [2024-10-14 05:16:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1310 states have (on average 1.3557251908396946) internal successors, (1776), 1330 states have internal predecessors, (1776), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2024-10-14 05:16:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2200 transitions. [2024-10-14 05:16:03,355 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2200 transitions. Word has length 80 [2024-10-14 05:16:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2200 transitions. [2024-10-14 05:16:03,356 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-14 05:16:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2200 transitions. [2024-10-14 05:16:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 05:16:03,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:03,356 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-14 05:16:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:16:03,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:03,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash -256758516, now seen corresponding path program 1 times [2024-10-14 05:16:03,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229894045] [2024-10-14 05:16:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:16:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:03,476 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-14 05:16:03,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:03,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229894045] [2024-10-14 05:16:03,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229894045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:03,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:16:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445200999] [2024-10-14 05:16:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:03,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:16:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:03,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:16:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:16:03,478 INFO L87 Difference]: Start difference. First operand 1653 states and 2200 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-14 05:16:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:04,999 INFO L93 Difference]: Finished difference Result 3874 states and 5086 transitions. [2024-10-14 05:16:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 05:16:05,000 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-14 05:16:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:05,017 INFO L225 Difference]: With dead ends: 3874 [2024-10-14 05:16:05,017 INFO L226 Difference]: Without dead ends: 2389 [2024-10-14 05:16:05,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-14 05:16:05,022 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1810 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 2183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:05,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 2003 Invalid, 2183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:16:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2024-10-14 05:16:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2225. [2024-10-14 05:16:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1728 states have (on average 1.3130787037037037) internal successors, (2269), 1756 states have internal predecessors, (2269), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2024-10-14 05:16:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2901 transitions. [2024-10-14 05:16:05,158 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2901 transitions. Word has length 81 [2024-10-14 05:16:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:05,158 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 2901 transitions. [2024-10-14 05:16:05,159 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-14 05:16:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2901 transitions. [2024-10-14 05:16:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:16:05,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:05,161 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:05,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:16:05,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 491189520, now seen corresponding path program 1 times [2024-10-14 05:16:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230707959] [2024-10-14 05:16:05,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:16:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 05:16:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 05:16:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 05:16:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:16:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 05:16:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 05:16:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 05:16:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 05:16:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 05:16:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230707959] [2024-10-14 05:16:05,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230707959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:16:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595648403] [2024-10-14 05:16:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:05,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:16:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:16:05,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:16:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:16:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:16:05,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:16:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 05:16:05,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:16:05,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595648403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:05,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:16:05,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-14 05:16:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148500212] [2024-10-14 05:16:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:05,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:16:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:16:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:05,576 INFO L87 Difference]: Start difference. First operand 2225 states and 2901 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:16:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:05,817 INFO L93 Difference]: Finished difference Result 5821 states and 7400 transitions. [2024-10-14 05:16:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:16:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-10-14 05:16:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:05,832 INFO L225 Difference]: With dead ends: 5821 [2024-10-14 05:16:05,832 INFO L226 Difference]: Without dead ends: 3975 [2024-10-14 05:16:05,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:05,838 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 57 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:05,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1133 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:16:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2024-10-14 05:16:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3935. [2024-10-14 05:16:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3025 states have (on average 1.2770247933884298) internal successors, (3863), 3076 states have internal predecessors, (3863), 472 states have call successors, (472), 329 states have call predecessors, (472), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2024-10-14 05:16:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4970 transitions. [2024-10-14 05:16:06,082 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4970 transitions. Word has length 145 [2024-10-14 05:16:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:06,083 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 4970 transitions. [2024-10-14 05:16:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:16:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4970 transitions. [2024-10-14 05:16:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:06,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:06,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:06,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 05:16:06,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 05:16:06,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:06,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -989253688, now seen corresponding path program 1 times [2024-10-14 05:16:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715545871] [2024-10-14 05:16:06,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:06,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715545871] [2024-10-14 05:16:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715545871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:06,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:16:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059382765] [2024-10-14 05:16:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:16:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:16:06,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:16:06,462 INFO L87 Difference]: Start difference. First operand 3935 states and 4970 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:08,419 INFO L93 Difference]: Finished difference Result 4340 states and 5645 transitions. [2024-10-14 05:16:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:16:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:08,450 INFO L225 Difference]: With dead ends: 4340 [2024-10-14 05:16:08,450 INFO L226 Difference]: Without dead ends: 4045 [2024-10-14 05:16:08,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:16:08,452 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 936 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:08,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 772 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:16:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2024-10-14 05:16:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 3935. [2024-10-14 05:16:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3025 states have (on average 1.276694214876033) internal successors, (3862), 3076 states have internal predecessors, (3862), 472 states have call successors, (472), 329 states have call predecessors, (472), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2024-10-14 05:16:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4969 transitions. [2024-10-14 05:16:09,247 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4969 transitions. Word has length 141 [2024-10-14 05:16:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:09,247 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 4969 transitions. [2024-10-14 05:16:09,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4969 transitions. [2024-10-14 05:16:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:09,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:09,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:09,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:16:09,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:09,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash 628186762, now seen corresponding path program 1 times [2024-10-14 05:16:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677563824] [2024-10-14 05:16:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:09,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:09,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677563824] [2024-10-14 05:16:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677563824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:09,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:16:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528601221] [2024-10-14 05:16:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:09,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:16:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:16:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:16:09,381 INFO L87 Difference]: Start difference. First operand 3935 states and 4969 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:11,543 INFO L93 Difference]: Finished difference Result 4332 states and 5628 transitions. [2024-10-14 05:16:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:16:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:11,554 INFO L225 Difference]: With dead ends: 4332 [2024-10-14 05:16:11,554 INFO L226 Difference]: Without dead ends: 4045 [2024-10-14 05:16:11,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:16:11,556 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 927 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:11,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 770 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:16:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2024-10-14 05:16:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 3935. [2024-10-14 05:16:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3025 states have (on average 1.2763636363636364) internal successors, (3861), 3076 states have internal predecessors, (3861), 472 states have call successors, (472), 329 states have call predecessors, (472), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2024-10-14 05:16:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4968 transitions. [2024-10-14 05:16:12,061 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4968 transitions. Word has length 141 [2024-10-14 05:16:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:12,061 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 4968 transitions. [2024-10-14 05:16:12,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4968 transitions. [2024-10-14 05:16:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:12,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:12,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:16:12,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1057845068, now seen corresponding path program 1 times [2024-10-14 05:16:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:12,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378644331] [2024-10-14 05:16:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:12,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378644331] [2024-10-14 05:16:12,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378644331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:12,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:12,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:16:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817429758] [2024-10-14 05:16:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:16:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:12,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:16:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:16:12,224 INFO L87 Difference]: Start difference. First operand 3935 states and 4968 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:15,161 INFO L93 Difference]: Finished difference Result 4738 states and 6306 transitions. [2024-10-14 05:16:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:16:15,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:15,176 INFO L225 Difference]: With dead ends: 4738 [2024-10-14 05:16:15,176 INFO L226 Difference]: Without dead ends: 4454 [2024-10-14 05:16:15,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:15,179 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1478 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:15,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1114 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:16:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2024-10-14 05:16:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4235. [2024-10-14 05:16:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 3299 states have (on average 1.3067596241285238) internal successors, (4311), 3351 states have internal predecessors, (4311), 491 states have call successors, (491), 335 states have call predecessors, (491), 443 states have return successors, (657), 550 states have call predecessors, (657), 489 states have call successors, (657) [2024-10-14 05:16:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 5459 transitions. [2024-10-14 05:16:15,859 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 5459 transitions. Word has length 141 [2024-10-14 05:16:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:15,863 INFO L471 AbstractCegarLoop]: Abstraction has 4235 states and 5459 transitions. [2024-10-14 05:16:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5459 transitions. [2024-10-14 05:16:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:15,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:15,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:15,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:16:15,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1457036300, now seen corresponding path program 1 times [2024-10-14 05:16:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586021744] [2024-10-14 05:16:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:16,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-14 05:16:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586021744] [2024-10-14 05:16:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586021744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:16,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:16,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468943932] [2024-10-14 05:16:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:16,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:16,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:16,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:16,154 INFO L87 Difference]: Start difference. First operand 4235 states and 5459 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:19,849 INFO L93 Difference]: Finished difference Result 5463 states and 7504 transitions. [2024-10-14 05:16:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:19,869 INFO L225 Difference]: With dead ends: 5463 [2024-10-14 05:16:19,870 INFO L226 Difference]: Without dead ends: 4879 [2024-10-14 05:16:19,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:19,874 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 1505 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:19,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1976 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:16:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2024-10-14 05:16:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4512. [2024-10-14 05:16:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3550 states have (on average 1.328169014084507) internal successors, (4715), 3603 states have internal predecessors, (4715), 510 states have call successors, (510), 341 states have call predecessors, (510), 450 states have return successors, (678), 570 states have call predecessors, (678), 508 states have call successors, (678) [2024-10-14 05:16:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 5903 transitions. [2024-10-14 05:16:20,556 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 5903 transitions. Word has length 141 [2024-10-14 05:16:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:20,557 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 5903 transitions. [2024-10-14 05:16:20,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 5903 transitions. [2024-10-14 05:16:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:20,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:20,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:20,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:16:20,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1945083406, now seen corresponding path program 1 times [2024-10-14 05:16:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117731351] [2024-10-14 05:16:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:20,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:20,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117731351] [2024-10-14 05:16:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117731351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:20,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319338549] [2024-10-14 05:16:20,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:20,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:20,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:20,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:20,782 INFO L87 Difference]: Start difference. First operand 4512 states and 5903 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:24,879 INFO L93 Difference]: Finished difference Result 6525 states and 9248 transitions. [2024-10-14 05:16:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:24,895 INFO L225 Difference]: With dead ends: 6525 [2024-10-14 05:16:24,895 INFO L226 Difference]: Without dead ends: 5664 [2024-10-14 05:16:24,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:24,899 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1503 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:24,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1974 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3462 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:16:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2024-10-14 05:16:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5067. [2024-10-14 05:16:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5067 states, 4053 states have (on average 1.3629410313348138) internal successors, (5524), 4108 states have internal predecessors, (5524), 548 states have call successors, (548), 353 states have call predecessors, (548), 464 states have return successors, (724), 610 states have call predecessors, (724), 546 states have call successors, (724) [2024-10-14 05:16:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 6796 transitions. [2024-10-14 05:16:25,538 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 6796 transitions. Word has length 141 [2024-10-14 05:16:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:25,539 INFO L471 AbstractCegarLoop]: Abstraction has 5067 states and 6796 transitions. [2024-10-14 05:16:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 6796 transitions. [2024-10-14 05:16:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:25,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:25,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:25,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:16:25,541 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash 852448204, now seen corresponding path program 1 times [2024-10-14 05:16:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703420640] [2024-10-14 05:16:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:25,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:25,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703420640] [2024-10-14 05:16:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703420640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277812780] [2024-10-14 05:16:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:25,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:25,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:25,713 INFO L87 Difference]: Start difference. First operand 5067 states and 6796 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:29,499 INFO L93 Difference]: Finished difference Result 8560 states and 12573 transitions. [2024-10-14 05:16:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:29,520 INFO L225 Difference]: With dead ends: 8560 [2024-10-14 05:16:29,520 INFO L226 Difference]: Without dead ends: 7144 [2024-10-14 05:16:29,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:29,526 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1499 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3453 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:29,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1974 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3453 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:16:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7144 states. [2024-10-14 05:16:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7144 to 6178. [2024-10-14 05:16:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6178 states, 5060 states have (on average 1.4114624505928854) internal successors, (7142), 5119 states have internal predecessors, (7142), 624 states have call successors, (624), 377 states have call predecessors, (624), 492 states have return successors, (822), 690 states have call predecessors, (822), 622 states have call successors, (822) [2024-10-14 05:16:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6178 states to 6178 states and 8588 transitions. [2024-10-14 05:16:30,192 INFO L78 Accepts]: Start accepts. Automaton has 6178 states and 8588 transitions. Word has length 141 [2024-10-14 05:16:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 6178 states and 8588 transitions. [2024-10-14 05:16:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6178 states and 8588 transitions. [2024-10-14 05:16:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:30,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:30,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:16:30,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -429724082, now seen corresponding path program 1 times [2024-10-14 05:16:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:30,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017022606] [2024-10-14 05:16:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:30,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017022606] [2024-10-14 05:16:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017022606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866210211] [2024-10-14 05:16:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:30,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:30,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:30,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:30,365 INFO L87 Difference]: Start difference. First operand 6178 states and 8588 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:34,311 INFO L93 Difference]: Finished difference Result 12629 states and 19239 transitions. [2024-10-14 05:16:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:34,339 INFO L225 Difference]: With dead ends: 12629 [2024-10-14 05:16:34,339 INFO L226 Difference]: Without dead ends: 10102 [2024-10-14 05:16:34,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:34,348 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1495 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:34,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1974 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:16:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10102 states. [2024-10-14 05:16:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10102 to 8405. [2024-10-14 05:16:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8405 states, 7079 states have (on average 1.4668738522390168) internal successors, (10384), 7146 states have internal predecessors, (10384), 776 states have call successors, (776), 425 states have call predecessors, (776), 548 states have return successors, (1036), 850 states have call predecessors, (1036), 774 states have call successors, (1036) [2024-10-14 05:16:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 12196 transitions. [2024-10-14 05:16:35,147 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 12196 transitions. Word has length 141 [2024-10-14 05:16:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:35,148 INFO L471 AbstractCegarLoop]: Abstraction has 8405 states and 12196 transitions. [2024-10-14 05:16:35,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 12196 transitions. [2024-10-14 05:16:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:35,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:35,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:16:35,152 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2022767500, now seen corresponding path program 1 times [2024-10-14 05:16:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112270105] [2024-10-14 05:16:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112270105] [2024-10-14 05:16:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112270105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564517322] [2024-10-14 05:16:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:35,319 INFO L87 Difference]: Start difference. First operand 8405 states and 12196 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:39,372 INFO L93 Difference]: Finished difference Result 20766 states and 32629 transitions. [2024-10-14 05:16:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:39,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:39,412 INFO L225 Difference]: With dead ends: 20766 [2024-10-14 05:16:39,412 INFO L226 Difference]: Without dead ends: 16012 [2024-10-14 05:16:39,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:39,425 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1497 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:39,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1974 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:16:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2024-10-14 05:16:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 12872. [2024-10-14 05:16:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12872 states, 11130 states have (on average 1.517160826594789) internal successors, (16886), 11213 states have internal predecessors, (16886), 1080 states have call successors, (1080), 521 states have call predecessors, (1080), 660 states have return successors, (1518), 1170 states have call predecessors, (1518), 1078 states have call successors, (1518) [2024-10-14 05:16:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 19484 transitions. [2024-10-14 05:16:40,471 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 19484 transitions. Word has length 141 [2024-10-14 05:16:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:40,472 INFO L471 AbstractCegarLoop]: Abstraction has 12872 states and 19484 transitions. [2024-10-14 05:16:40,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 19484 transitions. [2024-10-14 05:16:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:40,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:40,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:40,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:16:40,477 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:40,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 300764814, now seen corresponding path program 1 times [2024-10-14 05:16:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:40,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178287092] [2024-10-14 05:16:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178287092] [2024-10-14 05:16:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178287092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:40,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706466619] [2024-10-14 05:16:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:40,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:40,642 INFO L87 Difference]: Start difference. First operand 12872 states and 19484 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:44,803 INFO L93 Difference]: Finished difference Result 37008 states and 59539 transitions. [2024-10-14 05:16:44,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:44,891 INFO L225 Difference]: With dead ends: 37008 [2024-10-14 05:16:44,891 INFO L226 Difference]: Without dead ends: 27787 [2024-10-14 05:16:44,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:44,918 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1493 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:44,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1974 Invalid, 3501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:16:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27787 states. [2024-10-14 05:16:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27787 to 21868. [2024-10-14 05:16:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21868 states, 19294 states have (on average 1.5547838706333574) internal successors, (29998), 19409 states have internal predecessors, (29998), 1688 states have call successors, (1688), 713 states have call predecessors, (1688), 884 states have return successors, (2644), 1810 states have call predecessors, (2644), 1686 states have call successors, (2644) [2024-10-14 05:16:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21868 states to 21868 states and 34330 transitions. [2024-10-14 05:16:46,703 INFO L78 Accepts]: Start accepts. Automaton has 21868 states and 34330 transitions. Word has length 141 [2024-10-14 05:16:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:46,703 INFO L471 AbstractCegarLoop]: Abstraction has 21868 states and 34330 transitions. [2024-10-14 05:16:46,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21868 states and 34330 transitions. [2024-10-14 05:16:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:46,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:46,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:16:46,718 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:46,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2065270256, now seen corresponding path program 1 times [2024-10-14 05:16:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301442158] [2024-10-14 05:16:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:46,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301442158] [2024-10-14 05:16:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301442158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:46,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:46,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393333096] [2024-10-14 05:16:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:46,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:46,868 INFO L87 Difference]: Start difference. First operand 21868 states and 34330 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:52,268 INFO L93 Difference]: Finished difference Result 69558 states and 114087 transitions. [2024-10-14 05:16:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:52,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:16:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:52,448 INFO L225 Difference]: With dead ends: 69558 [2024-10-14 05:16:52,448 INFO L226 Difference]: Without dead ends: 51341 [2024-10-14 05:16:52,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:52,506 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1492 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:52,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1974 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3389 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 05:16:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51341 states. [2024-10-14 05:16:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51341 to 39921. [2024-10-14 05:16:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39921 states, 35683 states have (on average 1.5781184317462096) internal successors, (56312), 35862 states have internal predecessors, (56312), 2904 states have call successors, (2904), 1097 states have call predecessors, (2904), 1332 states have return successors, (5382), 3090 states have call predecessors, (5382), 2902 states have call successors, (5382) [2024-10-14 05:16:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39921 states to 39921 states and 64598 transitions. [2024-10-14 05:16:55,653 INFO L78 Accepts]: Start accepts. Automaton has 39921 states and 64598 transitions. Word has length 141 [2024-10-14 05:16:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:55,654 INFO L471 AbstractCegarLoop]: Abstraction has 39921 states and 64598 transitions. [2024-10-14 05:16:55,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:16:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39921 states and 64598 transitions. [2024-10-14 05:16:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:16:55,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:55,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:16:55,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:16:55,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:55,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash -63383986, now seen corresponding path program 1 times [2024-10-14 05:16:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:55,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879912330] [2024-10-14 05:16:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:55,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:16:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:55,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:16:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:16:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:16:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879912330] [2024-10-14 05:16:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879912330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337848076] [2024-10-14 05:16:56,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:56,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:56,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:56,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:56,003 INFO L87 Difference]: Start difference. First operand 39921 states and 64598 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:17:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:17:04,927 INFO L93 Difference]: Finished difference Result 134657 states and 225029 transitions. [2024-10-14 05:17:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:17:04,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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 141 [2024-10-14 05:17:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:17:05,233 INFO L225 Difference]: With dead ends: 134657 [2024-10-14 05:17:05,233 INFO L226 Difference]: Without dead ends: 98387 [2024-10-14 05:17:05,373 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-14 05:17:05,373 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1491 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:17:05,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1974 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:17:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98387 states. [2024-10-14 05:17:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98387 to 76154. [2024-10-14 05:17:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76154 states, 68588 states have (on average 1.5910946521257363) internal successors, (109130), 68895 states have internal predecessors, (109130), 5336 states have call successors, (5336), 1865 states have call predecessors, (5336), 2228 states have return successors, (12316), 5650 states have call predecessors, (12316), 5334 states have call successors, (12316) [2024-10-14 05:17:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76154 states to 76154 states and 126782 transitions. [2024-10-14 05:17:11,085 INFO L78 Accepts]: Start accepts. Automaton has 76154 states and 126782 transitions. Word has length 141 [2024-10-14 05:17:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:17:11,086 INFO L471 AbstractCegarLoop]: Abstraction has 76154 states and 126782 transitions. [2024-10-14 05:17:11,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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-14 05:17:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 76154 states and 126782 transitions. [2024-10-14 05:17:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 05:17:11,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:17:11,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:17:11,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:17:11,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:17:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:17:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1663760976, now seen corresponding path program 1 times [2024-10-14 05:17:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:17:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781950193] [2024-10-14 05:17:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:17:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:17:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:17:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:17:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:17:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 05:17:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:17:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:17:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:17:11,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 05:17:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:17:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 05:17:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:17:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:17:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:17:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781950193] [2024-10-14 05:17:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781950193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:17:11,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:17:11,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:17:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60736556] [2024-10-14 05:17:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:17:11,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:17:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:17:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:17:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:17:11,443 INFO L87 Difference]: Start difference. First operand 76154 states and 126782 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (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)