./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.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:10:46,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:10:46,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:10:46,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:10:46,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:10:46,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:10:46,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:10:46,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:10:46,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:10:46,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:10:46,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:10:46,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:10:46,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:10:46,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:10:46,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:10:46,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:10:46,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:10:46,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:10:46,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:10:46,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:10:46,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:10:46,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:10:46,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:10:46,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:10:46,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:10:46,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:10:46,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:10:46,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:10:46,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:10:46,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:10:46,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:10:46,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:10:46,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:10:46,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:10:46,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:10:46,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:10:46,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:10:46,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:10:46,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:10:46,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:10:46,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:10:46,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:10:46,222 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2024-11-20 00:10:46,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:10:46,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:10:46,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:10:46,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:10:46,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:10:46,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-20 00:10:47,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:10:48,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:10:48,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-20 00:10:48,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390e91589/68e53e65f2964a2d90c29fedc026471d/FLAG8bc0064e4 [2024-11-20 00:10:48,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390e91589/68e53e65f2964a2d90c29fedc026471d [2024-11-20 00:10:48,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:10:48,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:10:48,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:10:48,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:10:48,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:10:48,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0d2c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48, skipping insertion in model container [2024-11-20 00:10:48,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:10:48,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2024-11-20 00:10:48,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2024-11-20 00:10:48,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:10:48,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:10:48,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2024-11-20 00:10:48,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2024-11-20 00:10:48,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:10:48,703 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:10:48,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48 WrapperNode [2024-11-20 00:10:48,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:10:48,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:10:48,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:10:48,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:10:48,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,773 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 506 [2024-11-20 00:10:48,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:10:48,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:10:48,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:10:48,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:10:48,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,828 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-11-20 00:10:48,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:10:48,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:10:48,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:10:48,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:10:48,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (1/1) ... [2024-11-20 00:10:48,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:10:48,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:48,900 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-11-20 00:10:48,903 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-11-20 00:10:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:10:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:10:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:10:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:10:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:10:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:10:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:10:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:10:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:10:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:10:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:10:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:10:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:10:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:10:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:10:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:10:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:10:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:10:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:10:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:10:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:10:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:10:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:10:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:10:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:10:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:10:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:10:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:10:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:10:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:10:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:10:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:10:49,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:10:49,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:10:49,535 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-20 00:10:49,535 INFO L735 $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-11-20 00:10:49,627 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-11-20 00:10:49,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:10:49,654 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:10:49,654 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-20 00:10:49,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:10:49 BoogieIcfgContainer [2024-11-20 00:10:49,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:10:49,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:10:49,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:10:49,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:10:49,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:10:48" (1/3) ... [2024-11-20 00:10:49,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec0c8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:10:49, skipping insertion in model container [2024-11-20 00:10:49,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:48" (2/3) ... [2024-11-20 00:10:49,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec0c8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:10:49, skipping insertion in model container [2024-11-20 00:10:49,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:10:49" (3/3) ... [2024-11-20 00:10:49,665 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-20 00:10:49,680 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:10:49,680 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:10:49,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:10:49,752 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;@7b44b910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:10:49,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:10:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 203 states have (on average 1.5467980295566504) internal successors, (314), 209 states have internal predecessors, (314), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 00:10:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:49,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:49,774 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] [2024-11-20 00:10:49,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:49,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -881887354, now seen corresponding path program 1 times [2024-11-20 00:10:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129090118] [2024-11-20 00:10:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129090118] [2024-11-20 00:10:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129090118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734219145] [2024-11-20 00:10:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:50,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:50,440 INFO L87 Difference]: Start difference. First operand has 252 states, 203 states have (on average 1.5467980295566504) internal successors, (314), 209 states have internal predecessors, (314), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 00:10:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:51,619 INFO L93 Difference]: Finished difference Result 637 states and 963 transitions. [2024-11-20 00:10:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-20 00:10:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:51,634 INFO L225 Difference]: With dead ends: 637 [2024-11-20 00:10:51,634 INFO L226 Difference]: Without dead ends: 393 [2024-11-20 00:10:51,643 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-11-20 00:10:51,647 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 519 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:51,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1056 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:10:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-20 00:10:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 354. [2024-11-20 00:10:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 285 states have (on average 1.4421052631578948) internal successors, (411), 291 states have internal predecessors, (411), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-20 00:10:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 504 transitions. [2024-11-20 00:10:51,762 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 504 transitions. Word has length 65 [2024-11-20 00:10:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 504 transitions. [2024-11-20 00:10:51,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 00:10:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 504 transitions. [2024-11-20 00:10:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:51,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:51,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:51,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:10:51,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 797001286, now seen corresponding path program 1 times [2024-11-20 00:10:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701641099] [2024-11-20 00:10:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:51,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701641099] [2024-11-20 00:10:51,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701641099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:51,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:51,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366149582] [2024-11-20 00:10:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:51,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:51,951 INFO L87 Difference]: Start difference. First operand 354 states and 504 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:52,817 INFO L93 Difference]: Finished difference Result 822 states and 1156 transitions. [2024-11-20 00:10:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:10:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-20 00:10:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:52,825 INFO L225 Difference]: With dead ends: 822 [2024-11-20 00:10:52,826 INFO L226 Difference]: Without dead ends: 613 [2024-11-20 00:10:52,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:10:52,832 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 777 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:52,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1054 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-20 00:10:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 539. [2024-11-20 00:10:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 434 states have (on average 1.4170506912442395) internal successors, (615), 442 states have internal predecessors, (615), 65 states have call successors, (65), 35 states have call predecessors, (65), 38 states have return successors, (71), 64 states have call predecessors, (71), 63 states have call successors, (71) [2024-11-20 00:10:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 751 transitions. [2024-11-20 00:10:52,907 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 751 transitions. Word has length 65 [2024-11-20 00:10:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:52,908 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 751 transitions. [2024-11-20 00:10:52,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 751 transitions. [2024-11-20 00:10:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:10:52,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:52,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:10:52,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1040856949, now seen corresponding path program 1 times [2024-11-20 00:10:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438708880] [2024-11-20 00:10:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:10:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:10:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:53,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438708880] [2024-11-20 00:10:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438708880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865117410] [2024-11-20 00:10:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:53,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:53,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:53,086 INFO L87 Difference]: Start difference. First operand 539 states and 751 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-20 00:10:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:53,861 INFO L93 Difference]: Finished difference Result 1003 states and 1392 transitions. [2024-11-20 00:10:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-20 00:10:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:53,866 INFO L225 Difference]: With dead ends: 1003 [2024-11-20 00:10:53,866 INFO L226 Difference]: Without dead ends: 609 [2024-11-20 00:10:53,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:10:53,868 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 391 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:53,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1260 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-20 00:10:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 549. [2024-11-20 00:10:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 442 states have (on average 1.4049773755656108) internal successors, (621), 450 states have internal predecessors, (621), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (73), 66 states have call predecessors, (73), 63 states have call successors, (73) [2024-11-20 00:10:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 759 transitions. [2024-11-20 00:10:53,908 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 759 transitions. Word has length 66 [2024-11-20 00:10:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:53,908 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 759 transitions. [2024-11-20 00:10:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-20 00:10:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 759 transitions. [2024-11-20 00:10:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:10:53,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:53,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:10:53,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 11497651, now seen corresponding path program 1 times [2024-11-20 00:10:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158240485] [2024-11-20 00:10:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:10:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:10:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158240485] [2024-11-20 00:10:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158240485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:54,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240468489] [2024-11-20 00:10:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:54,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:54,114 INFO L87 Difference]: Start difference. First operand 549 states and 759 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:56,019 INFO L93 Difference]: Finished difference Result 2089 states and 2923 transitions. [2024-11-20 00:10:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:10:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-20 00:10:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:56,043 INFO L225 Difference]: With dead ends: 2089 [2024-11-20 00:10:56,044 INFO L226 Difference]: Without dead ends: 827 [2024-11-20 00:10:56,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 00:10:56,048 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1475 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:56,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:10:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-20 00:10:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 689. [2024-11-20 00:10:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 545 states have (on average 1.3706422018348623) internal successors, (747), 555 states have internal predecessors, (747), 85 states have call successors, (85), 49 states have call predecessors, (85), 57 states have return successors, (104), 87 states have call predecessors, (104), 83 states have call successors, (104) [2024-11-20 00:10:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 936 transitions. [2024-11-20 00:10:56,107 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 936 transitions. Word has length 66 [2024-11-20 00:10:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:56,107 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 936 transitions. [2024-11-20 00:10:56,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 936 transitions. [2024-11-20 00:10:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:10:56,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:56,111 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] [2024-11-20 00:10:56,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:10:56,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:56,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1897393456, now seen corresponding path program 1 times [2024-11-20 00:10:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:56,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318442484] [2024-11-20 00:10:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:10:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:10:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:10:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318442484] [2024-11-20 00:10:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318442484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902282948] [2024-11-20 00:10:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:56,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:56,262 INFO L87 Difference]: Start difference. First operand 689 states and 936 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:57,053 INFO L93 Difference]: Finished difference Result 1608 states and 2190 transitions. [2024-11-20 00:10:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 00:10:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-20 00:10:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:57,055 INFO L225 Difference]: With dead ends: 1608 [2024-11-20 00:10:57,056 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 00:10:57,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-20 00:10:57,060 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 914 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:57,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1000 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 00:10:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-20 00:10:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 109 states have internal predecessors, (157), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 00:10:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2024-11-20 00:10:57,068 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 67 [2024-11-20 00:10:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:57,068 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2024-11-20 00:10:57,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2024-11-20 00:10:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:10:57,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:57,070 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] [2024-11-20 00:10:57,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:10:57,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash 554342333, now seen corresponding path program 1 times [2024-11-20 00:10:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309311757] [2024-11-20 00:10:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309311757] [2024-11-20 00:10:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309311757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:57,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:57,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683307638] [2024-11-20 00:10:57,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:57,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:57,174 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 00:10:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:57,776 INFO L93 Difference]: Finished difference Result 433 states and 642 transitions. [2024-11-20 00:10:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:57,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2024-11-20 00:10:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:57,779 INFO L225 Difference]: With dead ends: 433 [2024-11-20 00:10:57,779 INFO L226 Difference]: Without dead ends: 313 [2024-11-20 00:10:57,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:57,781 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 415 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:57,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 449 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:10:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-20 00:10:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 250. [2024-11-20 00:10:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 211 states have internal predecessors, (306), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-11-20 00:10:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 363 transitions. [2024-11-20 00:10:57,803 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 363 transitions. Word has length 68 [2024-11-20 00:10:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 363 transitions. [2024-11-20 00:10:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 00:10:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 363 transitions. [2024-11-20 00:10:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:10:57,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:57,805 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] [2024-11-20 00:10:57,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:10:57,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:57,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2081676353, now seen corresponding path program 1 times [2024-11-20 00:10:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699449806] [2024-11-20 00:10:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:57,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699449806] [2024-11-20 00:10:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699449806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:57,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907362610] [2024-11-20 00:10:57,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:57,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:57,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:57,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:57,960 INFO L87 Difference]: Start difference. First operand 250 states and 363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:10:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:58,827 INFO L93 Difference]: Finished difference Result 702 states and 1032 transitions. [2024-11-20 00:10:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:58,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:10:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:58,831 INFO L225 Difference]: With dead ends: 702 [2024-11-20 00:10:58,831 INFO L226 Difference]: Without dead ends: 463 [2024-11-20 00:10:58,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:10:58,833 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 420 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:58,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 825 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-20 00:10:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 362. [2024-11-20 00:10:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 303 states have (on average 1.4554455445544554) internal successors, (441), 306 states have internal predecessors, (441), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-20 00:10:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 522 transitions. [2024-11-20 00:10:58,863 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 522 transitions. Word has length 68 [2024-11-20 00:10:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:58,863 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 522 transitions. [2024-11-20 00:10:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:10:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 522 transitions. [2024-11-20 00:10:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:10:58,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:58,867 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] [2024-11-20 00:10:58,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:10:58,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:58,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1337271937, now seen corresponding path program 1 times [2024-11-20 00:10:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071544447] [2024-11-20 00:10:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:58,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,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-11-20 00:10:59,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071544447] [2024-11-20 00:10:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071544447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474605083] [2024-11-20 00:10:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:59,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:59,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:59,002 INFO L87 Difference]: Start difference. First operand 362 states and 522 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:10:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:59,441 INFO L93 Difference]: Finished difference Result 812 states and 1193 transitions. [2024-11-20 00:10:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:10:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:59,447 INFO L225 Difference]: With dead ends: 812 [2024-11-20 00:10:59,447 INFO L226 Difference]: Without dead ends: 461 [2024-11-20 00:10:59,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:59,449 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 320 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:59,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 411 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:10:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-20 00:10:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 362. [2024-11-20 00:10:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 303 states have (on average 1.4455445544554455) internal successors, (438), 306 states have internal predecessors, (438), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-20 00:10:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 519 transitions. [2024-11-20 00:10:59,477 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 519 transitions. Word has length 68 [2024-11-20 00:10:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:59,477 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 519 transitions. [2024-11-20 00:10:59,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:10:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2024-11-20 00:10:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:10:59,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:59,479 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] [2024-11-20 00:10:59,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:10:59,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:59,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash 201068093, now seen corresponding path program 1 times [2024-11-20 00:10:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653422687] [2024-11-20 00:10:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:59,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653422687] [2024-11-20 00:10:59,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653422687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:59,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039643537] [2024-11-20 00:10:59,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:59,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:59,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:59,598 INFO L87 Difference]: Start difference. First operand 362 states and 519 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:00,480 INFO L93 Difference]: Finished difference Result 1142 states and 1655 transitions. [2024-11-20 00:11:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:11:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:11:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:00,485 INFO L225 Difference]: With dead ends: 1142 [2024-11-20 00:11:00,485 INFO L226 Difference]: Without dead ends: 791 [2024-11-20 00:11:00,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:00,489 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 461 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:00,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 809 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-20 00:11:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 577. [2024-11-20 00:11:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 484 states have (on average 1.4400826446280992) internal successors, (697), 489 states have internal predecessors, (697), 58 states have call successors, (58), 30 states have call predecessors, (58), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-20 00:11:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 826 transitions. [2024-11-20 00:11:00,533 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 826 transitions. Word has length 68 [2024-11-20 00:11:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:00,533 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 826 transitions. [2024-11-20 00:11:00,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 826 transitions. [2024-11-20 00:11:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:00,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:00,535 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] [2024-11-20 00:11:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:11:00,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1827518017, now seen corresponding path program 1 times [2024-11-20 00:11:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:00,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62777449] [2024-11-20 00:11:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62777449] [2024-11-20 00:11:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62777449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:00,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:00,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204247224] [2024-11-20 00:11:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:00,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:00,668 INFO L87 Difference]: Start difference. First operand 577 states and 826 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:01,599 INFO L93 Difference]: Finished difference Result 1863 states and 2680 transitions. [2024-11-20 00:11:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:11:01,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:11:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:01,607 INFO L225 Difference]: With dead ends: 1863 [2024-11-20 00:11:01,608 INFO L226 Difference]: Without dead ends: 1297 [2024-11-20 00:11:01,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:01,610 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 404 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:01,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 813 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-11-20 00:11:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1010. [2024-11-20 00:11:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 851 states have (on average 1.437132784958872) internal successors, (1223), 860 states have internal predecessors, (1223), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2024-11-20 00:11:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1450 transitions. [2024-11-20 00:11:01,695 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1450 transitions. Word has length 68 [2024-11-20 00:11:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1450 transitions. [2024-11-20 00:11:01,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1450 transitions. [2024-11-20 00:11:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:01,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:01,697 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] [2024-11-20 00:11:01,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:11:01,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:01,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1986369021, now seen corresponding path program 1 times [2024-11-20 00:11:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536235500] [2024-11-20 00:11:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:01,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:01,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536235500] [2024-11-20 00:11:01,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536235500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:01,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:01,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792579016] [2024-11-20 00:11:01,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:01,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:01,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:01,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:01,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:01,807 INFO L87 Difference]: Start difference. First operand 1010 states and 1450 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:02,299 INFO L93 Difference]: Finished difference Result 2240 states and 3257 transitions. [2024-11-20 00:11:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 00:11:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:11:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:02,306 INFO L225 Difference]: With dead ends: 2240 [2024-11-20 00:11:02,306 INFO L226 Difference]: Without dead ends: 1242 [2024-11-20 00:11:02,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:02,310 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 146 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:02,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 578 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2024-11-20 00:11:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1037. [2024-11-20 00:11:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 878 states have (on average 1.4236902050113895) internal successors, (1250), 887 states have internal predecessors, (1250), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2024-11-20 00:11:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1477 transitions. [2024-11-20 00:11:02,388 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1477 transitions. Word has length 68 [2024-11-20 00:11:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:02,388 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1477 transitions. [2024-11-20 00:11:02,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1477 transitions. [2024-11-20 00:11:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:02,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:02,390 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] [2024-11-20 00:11:02,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:11:02,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:02,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1884951553, now seen corresponding path program 1 times [2024-11-20 00:11:02,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:02,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030938916] [2024-11-20 00:11:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030938916] [2024-11-20 00:11:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030938916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:11:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266718883] [2024-11-20 00:11:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:02,476 INFO L87 Difference]: Start difference. First operand 1037 states and 1477 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 00:11:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:03,301 INFO L93 Difference]: Finished difference Result 3454 states and 4947 transitions. [2024-11-20 00:11:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:03,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2024-11-20 00:11:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:03,315 INFO L225 Difference]: With dead ends: 3454 [2024-11-20 00:11:03,316 INFO L226 Difference]: Without dead ends: 2429 [2024-11-20 00:11:03,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:11:03,319 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 585 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:03,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 613 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:11:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2024-11-20 00:11:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2008. [2024-11-20 00:11:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1700 states have (on average 1.4147058823529413) internal successors, (2405), 1717 states have internal predecessors, (2405), 183 states have call successors, (183), 108 states have call predecessors, (183), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-20 00:11:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2834 transitions. [2024-11-20 00:11:03,504 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2834 transitions. Word has length 68 [2024-11-20 00:11:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:03,505 INFO L471 AbstractCegarLoop]: Abstraction has 2008 states and 2834 transitions. [2024-11-20 00:11:03,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 00:11:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2834 transitions. [2024-11-20 00:11:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:03,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:03,507 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] [2024-11-20 00:11:03,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:11:03,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:03,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1453087360, now seen corresponding path program 1 times [2024-11-20 00:11:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:03,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023415726] [2024-11-20 00:11:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023415726] [2024-11-20 00:11:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023415726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058266327] [2024-11-20 00:11:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:03,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:03,642 INFO L87 Difference]: Start difference. First operand 2008 states and 2834 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:04,302 INFO L93 Difference]: Finished difference Result 4459 states and 6359 transitions. [2024-11-20 00:11:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:11:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:11:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:04,323 INFO L225 Difference]: With dead ends: 4459 [2024-11-20 00:11:04,325 INFO L226 Difference]: Without dead ends: 2463 [2024-11-20 00:11:04,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 00:11:04,332 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 159 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:04,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 578 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2024-11-20 00:11:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2035. [2024-11-20 00:11:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1727 states have (on average 1.4030110017371165) internal successors, (2423), 1744 states have internal predecessors, (2423), 183 states have call successors, (183), 108 states have call predecessors, (183), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-20 00:11:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2852 transitions. [2024-11-20 00:11:04,520 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2852 transitions. Word has length 68 [2024-11-20 00:11:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:04,521 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2852 transitions. [2024-11-20 00:11:04,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2852 transitions. [2024-11-20 00:11:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:04,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:04,522 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] [2024-11-20 00:11:04,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:11:04,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 609081858, now seen corresponding path program 1 times [2024-11-20 00:11:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:04,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158798006] [2024-11-20 00:11:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158798006] [2024-11-20 00:11:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158798006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933427091] [2024-11-20 00:11:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:04,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:04,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:04,618 INFO L87 Difference]: Start difference. First operand 2035 states and 2852 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:05,178 INFO L93 Difference]: Finished difference Result 4594 states and 6485 transitions. [2024-11-20 00:11:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:11:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2024-11-20 00:11:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:05,193 INFO L225 Difference]: With dead ends: 4594 [2024-11-20 00:11:05,193 INFO L226 Difference]: Without dead ends: 2571 [2024-11-20 00:11:05,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 00:11:05,200 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 161 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:05,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 573 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-11-20 00:11:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2089. [2024-11-20 00:11:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 1781 states have (on average 1.390791690061763) internal successors, (2477), 1798 states have internal predecessors, (2477), 183 states have call successors, (183), 108 states have call predecessors, (183), 124 states have return successors, (246), 190 states have call predecessors, (246), 183 states have call successors, (246) [2024-11-20 00:11:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2906 transitions. [2024-11-20 00:11:05,382 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2906 transitions. Word has length 68 [2024-11-20 00:11:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:05,383 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2906 transitions. [2024-11-20 00:11:05,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-11-20 00:11:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2906 transitions. [2024-11-20 00:11:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:05,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:05,384 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] [2024-11-20 00:11:05,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:11:05,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:05,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1995285252, now seen corresponding path program 1 times [2024-11-20 00:11:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813776917] [2024-11-20 00:11:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813776917] [2024-11-20 00:11:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813776917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:05,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:05,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61375850] [2024-11-20 00:11:05,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:05,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:05,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:05,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:05,520 INFO L87 Difference]: Start difference. First operand 2089 states and 2906 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:06,265 INFO L93 Difference]: Finished difference Result 2991 states and 4159 transitions. [2024-11-20 00:11:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:11:06,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-20 00:11:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:06,276 INFO L225 Difference]: With dead ends: 2991 [2024-11-20 00:11:06,276 INFO L226 Difference]: Without dead ends: 1803 [2024-11-20 00:11:06,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:11:06,281 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 541 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:06,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 624 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-20 00:11:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1389. [2024-11-20 00:11:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1182 states have (on average 1.3764805414551609) internal successors, (1627), 1191 states have internal predecessors, (1627), 126 states have call successors, (126), 72 states have call predecessors, (126), 80 states have return successors, (147), 129 states have call predecessors, (147), 126 states have call successors, (147) [2024-11-20 00:11:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1900 transitions. [2024-11-20 00:11:06,393 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1900 transitions. Word has length 68 [2024-11-20 00:11:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:06,394 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1900 transitions. [2024-11-20 00:11:06,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1900 transitions. [2024-11-20 00:11:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:06,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:06,395 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] [2024-11-20 00:11:06,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:11:06,396 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:06,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1861271746, now seen corresponding path program 1 times [2024-11-20 00:11:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476288697] [2024-11-20 00:11:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476288697] [2024-11-20 00:11:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476288697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643035620] [2024-11-20 00:11:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:06,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:06,515 INFO L87 Difference]: Start difference. First operand 1389 states and 1900 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:07,092 INFO L93 Difference]: Finished difference Result 3963 states and 5354 transitions. [2024-11-20 00:11:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-20 00:11:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:07,108 INFO L225 Difference]: With dead ends: 3963 [2024-11-20 00:11:07,108 INFO L226 Difference]: Without dead ends: 2586 [2024-11-20 00:11:07,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:11:07,114 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 550 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:07,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 349 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2024-11-20 00:11:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1740. [2024-11-20 00:11:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1503 states have (on average 1.3240186294078509) internal successors, (1990), 1512 states have internal predecessors, (1990), 135 states have call successors, (135), 93 states have call predecessors, (135), 101 states have return successors, (177), 138 states have call predecessors, (177), 135 states have call successors, (177) [2024-11-20 00:11:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2302 transitions. [2024-11-20 00:11:07,289 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2302 transitions. Word has length 68 [2024-11-20 00:11:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:07,292 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2302 transitions. [2024-11-20 00:11:07,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2302 transitions. [2024-11-20 00:11:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:07,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:07,294 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] [2024-11-20 00:11:07,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:11:07,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:07,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2080126464, now seen corresponding path program 1 times [2024-11-20 00:11:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798182226] [2024-11-20 00:11:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:07,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:07,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798182226] [2024-11-20 00:11:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798182226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451996108] [2024-11-20 00:11:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:07,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:07,436 INFO L87 Difference]: Start difference. First operand 1740 states and 2302 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:08,158 INFO L93 Difference]: Finished difference Result 3575 states and 4734 transitions. [2024-11-20 00:11:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-20 00:11:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:08,168 INFO L225 Difference]: With dead ends: 3575 [2024-11-20 00:11:08,168 INFO L226 Difference]: Without dead ends: 2384 [2024-11-20 00:11:08,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:11:08,172 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 697 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:08,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 545 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2024-11-20 00:11:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1730. [2024-11-20 00:11:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1495 states have (on average 1.3190635451505017) internal successors, (1972), 1502 states have internal predecessors, (1972), 135 states have call successors, (135), 93 states have call predecessors, (135), 99 states have return successors, (167), 136 states have call predecessors, (167), 135 states have call successors, (167) [2024-11-20 00:11:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2274 transitions. [2024-11-20 00:11:08,311 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2274 transitions. Word has length 68 [2024-11-20 00:11:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:08,312 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2274 transitions. [2024-11-20 00:11:08,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2274 transitions. [2024-11-20 00:11:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:08,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:08,313 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] [2024-11-20 00:11:08,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:11:08,313 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1792139006, now seen corresponding path program 1 times [2024-11-20 00:11:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:08,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475090180] [2024-11-20 00:11:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:08,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-11-20 00:11:08,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475090180] [2024-11-20 00:11:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475090180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:08,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567010916] [2024-11-20 00:11:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:08,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:08,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:08,460 INFO L87 Difference]: Start difference. First operand 1730 states and 2274 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:09,304 INFO L93 Difference]: Finished difference Result 3192 states and 4186 transitions. [2024-11-20 00:11:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-20 00:11:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:09,314 INFO L225 Difference]: With dead ends: 3192 [2024-11-20 00:11:09,314 INFO L226 Difference]: Without dead ends: 2015 [2024-11-20 00:11:09,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-20 00:11:09,318 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 533 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:09,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 615 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:11:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-20 00:11:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1449. [2024-11-20 00:11:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1253 states have (on average 1.3192338387869114) internal successors, (1653), 1256 states have internal predecessors, (1653), 115 states have call successors, (115), 78 states have call predecessors, (115), 80 states have return successors, (135), 115 states have call predecessors, (135), 115 states have call successors, (135) [2024-11-20 00:11:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1903 transitions. [2024-11-20 00:11:09,441 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1903 transitions. Word has length 68 [2024-11-20 00:11:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:09,441 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1903 transitions. [2024-11-20 00:11:09,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1903 transitions. [2024-11-20 00:11:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 00:11:09,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:09,442 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] [2024-11-20 00:11:09,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:11:09,443 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1685179840, now seen corresponding path program 1 times [2024-11-20 00:11:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:09,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318106658] [2024-11-20 00:11:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318106658] [2024-11-20 00:11:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318106658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123378958] [2024-11-20 00:11:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:09,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:09,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:09,509 INFO L87 Difference]: Start difference. First operand 1449 states and 1903 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-20 00:11:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:09,998 INFO L93 Difference]: Finished difference Result 4096 states and 5422 transitions. [2024-11-20 00:11:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:11:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2024-11-20 00:11:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:10,010 INFO L225 Difference]: With dead ends: 4096 [2024-11-20 00:11:10,010 INFO L226 Difference]: Without dead ends: 2650 [2024-11-20 00:11:10,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:10,018 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 465 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:10,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 338 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2024-11-20 00:11:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2101. [2024-11-20 00:11:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1811 states have (on average 1.308117062396466) internal successors, (2369), 1823 states have internal predecessors, (2369), 169 states have call successors, (169), 116 states have call predecessors, (169), 120 states have return successors, (187), 162 states have call predecessors, (187), 169 states have call successors, (187) [2024-11-20 00:11:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2725 transitions. [2024-11-20 00:11:10,222 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2725 transitions. Word has length 68 [2024-11-20 00:11:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:10,223 INFO L471 AbstractCegarLoop]: Abstraction has 2101 states and 2725 transitions. [2024-11-20 00:11:10,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-20 00:11:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2725 transitions. [2024-11-20 00:11:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 00:11:10,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:10,225 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:11:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:11:10,226 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash -997809819, now seen corresponding path program 1 times [2024-11-20 00:11:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:10,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884656607] [2024-11-20 00:11:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:11:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 00:11:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884656607] [2024-11-20 00:11:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884656607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509889660] [2024-11-20 00:11:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:10,485 INFO L87 Difference]: Start difference. First operand 2101 states and 2725 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:11,295 INFO L93 Difference]: Finished difference Result 7245 states and 9477 transitions. [2024-11-20 00:11:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 111 [2024-11-20 00:11:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:11,316 INFO L225 Difference]: With dead ends: 7245 [2024-11-20 00:11:11,316 INFO L226 Difference]: Without dead ends: 5157 [2024-11-20 00:11:11,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:11:11,324 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 478 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:11,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 576 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2024-11-20 00:11:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 4333. [2024-11-20 00:11:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 3729 states have (on average 1.2944489139179405) internal successors, (4827), 3771 states have internal predecessors, (4827), 330 states have call successors, (330), 231 states have call predecessors, (330), 273 states have return successors, (464), 332 states have call predecessors, (464), 330 states have call successors, (464) [2024-11-20 00:11:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 5621 transitions. [2024-11-20 00:11:11,778 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 5621 transitions. Word has length 111 [2024-11-20 00:11:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 5621 transitions. [2024-11-20 00:11:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 5621 transitions. [2024-11-20 00:11:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 00:11:11,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:11,783 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:11:11,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:11:11,783 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:11,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1430448803, now seen corresponding path program 1 times [2024-11-20 00:11:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:11,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482317462] [2024-11-20 00:11:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:11:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-20 00:11:11,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:11,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482317462] [2024-11-20 00:11:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482317462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101986943] [2024-11-20 00:11:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:11,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:11,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:11,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:11,856 INFO L87 Difference]: Start difference. First operand 4333 states and 5621 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:11:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:12,550 INFO L93 Difference]: Finished difference Result 8605 states and 11168 transitions. [2024-11-20 00:11:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:11:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 111 [2024-11-20 00:11:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:12,580 INFO L225 Difference]: With dead ends: 8605 [2024-11-20 00:11:12,582 INFO L226 Difference]: Without dead ends: 4285 [2024-11-20 00:11:12,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:12,593 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 363 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:12,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 256 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:11:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2024-11-20 00:11:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3511. [2024-11-20 00:11:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3029 states have (on average 1.2938263453284913) internal successors, (3919), 3065 states have internal predecessors, (3919), 259 states have call successors, (259), 182 states have call predecessors, (259), 222 states have return successors, (367), 264 states have call predecessors, (367), 259 states have call successors, (367) [2024-11-20 00:11:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 4545 transitions. [2024-11-20 00:11:12,946 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 4545 transitions. Word has length 111 [2024-11-20 00:11:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:12,946 INFO L471 AbstractCegarLoop]: Abstraction has 3511 states and 4545 transitions. [2024-11-20 00:11:12,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:11:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 4545 transitions. [2024-11-20 00:11:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 00:11:12,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:12,949 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:11:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:11:12,950 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1804883072, now seen corresponding path program 1 times [2024-11-20 00:11:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100148521] [2024-11-20 00:11:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 00:11:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 00:11:13,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100148521] [2024-11-20 00:11:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100148521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:13,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943601989] [2024-11-20 00:11:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:13,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:13,141 INFO L87 Difference]: Start difference. First operand 3511 states and 4545 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:14,509 INFO L93 Difference]: Finished difference Result 10881 states and 14174 transitions. [2024-11-20 00:11:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:14,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 113 [2024-11-20 00:11:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:14,541 INFO L225 Difference]: With dead ends: 10881 [2024-11-20 00:11:14,542 INFO L226 Difference]: Without dead ends: 7383 [2024-11-20 00:11:14,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:11:14,553 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 443 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:14,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 589 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:11:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2024-11-20 00:11:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6135. [2024-11-20 00:11:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6135 states, 5209 states have (on average 1.2900748704165867) internal successors, (6720), 5310 states have internal predecessors, (6720), 473 states have call successors, (473), 320 states have call predecessors, (473), 452 states have return successors, (809), 506 states have call predecessors, (809), 473 states have call successors, (809) [2024-11-20 00:11:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6135 states to 6135 states and 8002 transitions. [2024-11-20 00:11:15,323 INFO L78 Accepts]: Start accepts. Automaton has 6135 states and 8002 transitions. Word has length 113 [2024-11-20 00:11:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:15,324 INFO L471 AbstractCegarLoop]: Abstraction has 6135 states and 8002 transitions. [2024-11-20 00:11:15,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6135 states and 8002 transitions. [2024-11-20 00:11:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 00:11:15,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:15,328 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:11:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:11:15,328 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:15,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash -228510974, now seen corresponding path program 1 times [2024-11-20 00:11:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:15,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108721324] [2024-11-20 00:11:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 00:11:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-20 00:11:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108721324] [2024-11-20 00:11:15,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108721324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:15,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:15,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798675042] [2024-11-20 00:11:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:15,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:15,414 INFO L87 Difference]: Start difference. First operand 6135 states and 8002 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:11:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:16,276 INFO L93 Difference]: Finished difference Result 13404 states and 17494 transitions. [2024-11-20 00:11:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:11:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 113 [2024-11-20 00:11:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:16,305 INFO L225 Difference]: With dead ends: 13404 [2024-11-20 00:11:16,305 INFO L226 Difference]: Without dead ends: 7281 [2024-11-20 00:11:16,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:16,322 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 361 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:16,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 254 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 00:11:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7281 states. [2024-11-20 00:11:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7281 to 6131. [2024-11-20 00:11:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6131 states, 5208 states have (on average 1.2899385560675882) internal successors, (6718), 5308 states have internal predecessors, (6718), 470 states have call successors, (470), 320 states have call predecessors, (470), 452 states have return successors, (805), 503 states have call predecessors, (805), 470 states have call successors, (805) [2024-11-20 00:11:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 7993 transitions. [2024-11-20 00:11:16,983 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 7993 transitions. Word has length 113 [2024-11-20 00:11:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:16,983 INFO L471 AbstractCegarLoop]: Abstraction has 6131 states and 7993 transitions. [2024-11-20 00:11:16,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:11:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 7993 transitions. [2024-11-20 00:11:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 00:11:16,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:16,987 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 00:11:16,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:11:16,988 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 664171685, now seen corresponding path program 1 times [2024-11-20 00:11:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065134559] [2024-11-20 00:11:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 00:11:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-20 00:11:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065134559] [2024-11-20 00:11:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065134559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476973229] [2024-11-20 00:11:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:17,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:17,104 INFO L87 Difference]: Start difference. First operand 6131 states and 7993 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:19,749 INFO L93 Difference]: Finished difference Result 19567 states and 25799 transitions. [2024-11-20 00:11:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 00:11:19,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 115 [2024-11-20 00:11:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:19,786 INFO L225 Difference]: With dead ends: 19567 [2024-11-20 00:11:19,786 INFO L226 Difference]: Without dead ends: 10873 [2024-11-20 00:11:19,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-20 00:11:19,806 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1437 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:19,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 707 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:11:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10873 states. [2024-11-20 00:11:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10873 to 9415. [2024-11-20 00:11:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9415 states, 8057 states have (on average 1.2715650986719622) internal successors, (10245), 8213 states have internal predecessors, (10245), 668 states have call successors, (668), 474 states have call predecessors, (668), 689 states have return successors, (1128), 728 states have call predecessors, (1128), 668 states have call successors, (1128) [2024-11-20 00:11:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9415 states to 9415 states and 12041 transitions. [2024-11-20 00:11:20,823 INFO L78 Accepts]: Start accepts. Automaton has 9415 states and 12041 transitions. Word has length 115 [2024-11-20 00:11:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 9415 states and 12041 transitions. [2024-11-20 00:11:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-20 00:11:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 9415 states and 12041 transitions. [2024-11-20 00:11:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 00:11:20,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:20,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:20,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:11:20,831 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1089789147, now seen corresponding path program 1 times [2024-11-20 00:11:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541055024] [2024-11-20 00:11:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 00:11:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:11:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-20 00:11:20,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541055024] [2024-11-20 00:11:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541055024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:20,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777945866] [2024-11-20 00:11:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:20,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:20,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:20,924 INFO L87 Difference]: Start difference. First operand 9415 states and 12041 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-20 00:11:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:22,528 INFO L93 Difference]: Finished difference Result 23304 states and 29863 transitions. [2024-11-20 00:11:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:11:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2024-11-20 00:11:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:22,588 INFO L225 Difference]: With dead ends: 23304 [2024-11-20 00:11:22,589 INFO L226 Difference]: Without dead ends: 13901 [2024-11-20 00:11:22,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:22,614 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 433 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:22,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 332 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13901 states. [2024-11-20 00:11:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13901 to 11829. [2024-11-20 00:11:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11829 states, 10117 states have (on average 1.260946921024019) internal successors, (12757), 10291 states have internal predecessors, (12757), 862 states have call successors, (862), 612 states have call predecessors, (862), 849 states have return successors, (1364), 926 states have call predecessors, (1364), 862 states have call successors, (1364) [2024-11-20 00:11:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11829 states to 11829 states and 14983 transitions. [2024-11-20 00:11:24,326 INFO L78 Accepts]: Start accepts. Automaton has 11829 states and 14983 transitions. Word has length 146 [2024-11-20 00:11:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:24,327 INFO L471 AbstractCegarLoop]: Abstraction has 11829 states and 14983 transitions. [2024-11-20 00:11:24,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-20 00:11:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 11829 states and 14983 transitions. [2024-11-20 00:11:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 00:11:24,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:24,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:11:24,342 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash 551416306, now seen corresponding path program 1 times [2024-11-20 00:11:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556740150] [2024-11-20 00:11:24,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:11:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:11:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:11:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-20 00:11:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556740150] [2024-11-20 00:11:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556740150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:24,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:11:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754561607] [2024-11-20 00:11:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:24,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:24,536 INFO L87 Difference]: Start difference. First operand 11829 states and 14983 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:26,443 INFO L93 Difference]: Finished difference Result 23484 states and 29886 transitions. [2024-11-20 00:11:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:26,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 167 [2024-11-20 00:11:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:26,501 INFO L225 Difference]: With dead ends: 23484 [2024-11-20 00:11:26,501 INFO L226 Difference]: Without dead ends: 14082 [2024-11-20 00:11:26,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:26,526 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 826 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:26,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 623 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:11:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states. [2024-11-20 00:11:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 11857. [2024-11-20 00:11:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11857 states, 10131 states have (on average 1.2569341624716217) internal successors, (12734), 10312 states have internal predecessors, (12734), 862 states have call successors, (862), 612 states have call predecessors, (862), 863 states have return successors, (1366), 933 states have call predecessors, (1366), 862 states have call successors, (1366) [2024-11-20 00:11:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11857 states to 11857 states and 14962 transitions. [2024-11-20 00:11:27,746 INFO L78 Accepts]: Start accepts. Automaton has 11857 states and 14962 transitions. Word has length 167 [2024-11-20 00:11:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:27,746 INFO L471 AbstractCegarLoop]: Abstraction has 11857 states and 14962 transitions. [2024-11-20 00:11:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11857 states and 14962 transitions. [2024-11-20 00:11:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:11:27,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:27,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:11:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 00:11:27,757 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 300530536, now seen corresponding path program 1 times [2024-11-20 00:11:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588057333] [2024-11-20 00:11:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:11:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 00:11:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 00:11:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 00:11:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588057333] [2024-11-20 00:11:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588057333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513833764] [2024-11-20 00:11:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:27,946 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-11-20 00:11:27,947 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-11-20 00:11:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:28,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:28,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-20 00:11:28,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513833764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-20 00:11:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482612794] [2024-11-20 00:11:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:28,161 INFO L87 Difference]: Start difference. First operand 11857 states and 14962 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-20 00:11:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:29,272 INFO L93 Difference]: Finished difference Result 23632 states and 30620 transitions. [2024-11-20 00:11:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 168 [2024-11-20 00:11:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:29,318 INFO L225 Difference]: With dead ends: 23632 [2024-11-20 00:11:29,319 INFO L226 Difference]: Without dead ends: 12403 [2024-11-20 00:11:29,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:29,339 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 130 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:29,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 229 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12403 states. [2024-11-20 00:11:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12403 to 12337. [2024-11-20 00:11:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12337 states, 10618 states have (on average 1.2418534563948014) internal successors, (13186), 10772 states have internal predecessors, (13186), 876 states have call successors, (876), 656 states have call predecessors, (876), 842 states have return successors, (1404), 909 states have call predecessors, (1404), 876 states have call successors, (1404) [2024-11-20 00:11:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12337 states to 12337 states and 15466 transitions. [2024-11-20 00:11:30,283 INFO L78 Accepts]: Start accepts. Automaton has 12337 states and 15466 transitions. Word has length 168 [2024-11-20 00:11:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:30,284 INFO L471 AbstractCegarLoop]: Abstraction has 12337 states and 15466 transitions. [2024-11-20 00:11:30,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-20 00:11:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 12337 states and 15466 transitions. [2024-11-20 00:11:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-20 00:11:30,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:30,297 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:11:30,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 00:11:30,498 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,SelfDestructingSolverStorable26 [2024-11-20 00:11:30,498 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:30,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1634694218, now seen corresponding path program 1 times [2024-11-20 00:11:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413453389] [2024-11-20 00:11:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 00:11:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 00:11:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 00:11:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-20 00:11:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413453389] [2024-11-20 00:11:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413453389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514991359] [2024-11-20 00:11:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:30,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:30,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 00:11:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:30,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:11:30,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-20 00:11:30,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514991359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:30,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:11:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869173373] [2024-11-20 00:11:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:30,866 INFO L87 Difference]: Start difference. First operand 12337 states and 15466 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 00:11:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:32,285 INFO L93 Difference]: Finished difference Result 23905 states and 30676 transitions. [2024-11-20 00:11:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:32,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 202 [2024-11-20 00:11:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:32,335 INFO L225 Difference]: With dead ends: 23905 [2024-11-20 00:11:32,335 INFO L226 Difference]: Without dead ends: 11798 [2024-11-20 00:11:32,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:32,364 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 132 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:32,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2024-11-20 00:11:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 11782. [2024-11-20 00:11:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11782 states, 10120 states have (on average 1.199308300395257) internal successors, (12137), 10210 states have internal predecessors, (12137), 876 states have call successors, (876), 672 states have call predecessors, (876), 785 states have return successors, (1207), 900 states have call predecessors, (1207), 876 states have call successors, (1207) [2024-11-20 00:11:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11782 states to 11782 states and 14220 transitions. [2024-11-20 00:11:33,847 INFO L78 Accepts]: Start accepts. Automaton has 11782 states and 14220 transitions. Word has length 202 [2024-11-20 00:11:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 11782 states and 14220 transitions. [2024-11-20 00:11:33,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 00:11:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11782 states and 14220 transitions. [2024-11-20 00:11:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-20 00:11:33,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:33,859 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:33,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:34,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 00:11:34,060 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:34,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -430196228, now seen corresponding path program 1 times [2024-11-20 00:11:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:34,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922196732] [2024-11-20 00:11:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 00:11:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 00:11:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 00:11:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-20 00:11:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922196732] [2024-11-20 00:11:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922196732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156379148] [2024-11-20 00:11:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:34,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:34,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:34,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 00:11:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:34,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:11:34,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 00:11:34,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156379148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:34,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:34,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:11:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208730765] [2024-11-20 00:11:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:34,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:34,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:34,518 INFO L87 Difference]: Start difference. First operand 11782 states and 14220 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:35,257 INFO L93 Difference]: Finished difference Result 19001 states and 22918 transitions. [2024-11-20 00:11:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 202 [2024-11-20 00:11:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:35,301 INFO L225 Difference]: With dead ends: 19001 [2024-11-20 00:11:35,301 INFO L226 Difference]: Without dead ends: 10153 [2024-11-20 00:11:35,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:35,320 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 134 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:35,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 430 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2024-11-20 00:11:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 10046. [2024-11-20 00:11:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10046 states, 8683 states have (on average 1.1983185534953358) internal successors, (10405), 8767 states have internal predecessors, (10405), 704 states have call successors, (704), 557 states have call predecessors, (704), 658 states have return successors, (933), 722 states have call predecessors, (933), 704 states have call successors, (933) [2024-11-20 00:11:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10046 states to 10046 states and 12042 transitions. [2024-11-20 00:11:36,096 INFO L78 Accepts]: Start accepts. Automaton has 10046 states and 12042 transitions. Word has length 202 [2024-11-20 00:11:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 10046 states and 12042 transitions. [2024-11-20 00:11:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10046 states and 12042 transitions. [2024-11-20 00:11:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 00:11:36,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:36,102 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:36,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 00:11:36,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-20 00:11:36,303 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 591656774, now seen corresponding path program 1 times [2024-11-20 00:11:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197995183] [2024-11-20 00:11:36,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:11:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 00:11:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 00:11:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-20 00:11:36,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197995183] [2024-11-20 00:11:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197995183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593659559] [2024-11-20 00:11:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:36,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:36,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:36,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 00:11:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:36,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 00:11:36,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593659559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:36,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273315200] [2024-11-20 00:11:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:36,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:36,606 INFO L87 Difference]: Start difference. First operand 10046 states and 12042 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:37,399 INFO L93 Difference]: Finished difference Result 17873 states and 21801 transitions. [2024-11-20 00:11:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:37,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 203 [2024-11-20 00:11:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:37,426 INFO L225 Difference]: With dead ends: 17873 [2024-11-20 00:11:37,426 INFO L226 Difference]: Without dead ends: 9908 [2024-11-20 00:11:37,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:37,436 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 127 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:37,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 434 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9908 states. [2024-11-20 00:11:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9908 to 9886. [2024-11-20 00:11:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9886 states, 8523 states have (on average 1.1771676639680864) internal successors, (10033), 8607 states have internal predecessors, (10033), 704 states have call successors, (704), 557 states have call predecessors, (704), 658 states have return successors, (933), 722 states have call predecessors, (933), 704 states have call successors, (933) [2024-11-20 00:11:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9886 states to 9886 states and 11670 transitions. [2024-11-20 00:11:38,193 INFO L78 Accepts]: Start accepts. Automaton has 9886 states and 11670 transitions. Word has length 203 [2024-11-20 00:11:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:38,193 INFO L471 AbstractCegarLoop]: Abstraction has 9886 states and 11670 transitions. [2024-11-20 00:11:38,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9886 states and 11670 transitions. [2024-11-20 00:11:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-20 00:11:38,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:38,198 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:38,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:38,399 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:38,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:38,399 INFO L85 PathProgramCache]: Analyzing trace with hash 47058086, now seen corresponding path program 1 times [2024-11-20 00:11:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446533272] [2024-11-20 00:11:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 00:11:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-20 00:11:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 64 proven. 19 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-20 00:11:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446533272] [2024-11-20 00:11:38,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446533272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:38,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889742146] [2024-11-20 00:11:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:38,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:38,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:38,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:38,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 00:11:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:38,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:38,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-20 00:11:38,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889742146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:38,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:38,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:38,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913289473] [2024-11-20 00:11:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:38,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:38,711 INFO L87 Difference]: Start difference. First operand 9886 states and 11670 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:39,376 INFO L93 Difference]: Finished difference Result 17206 states and 20631 transitions. [2024-11-20 00:11:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 205 [2024-11-20 00:11:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:39,406 INFO L225 Difference]: With dead ends: 17206 [2024-11-20 00:11:39,406 INFO L226 Difference]: Without dead ends: 9564 [2024-11-20 00:11:39,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:39,419 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 147 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:39,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 422 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9564 states. [2024-11-20 00:11:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9564 to 9552. [2024-11-20 00:11:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9552 states, 8225 states have (on average 1.1608510638297873) internal successors, (9548), 8299 states have internal predecessors, (9548), 688 states have call successors, (688), 541 states have call predecessors, (688), 638 states have return successors, (913), 712 states have call predecessors, (913), 688 states have call successors, (913) [2024-11-20 00:11:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9552 states to 9552 states and 11149 transitions. [2024-11-20 00:11:40,226 INFO L78 Accepts]: Start accepts. Automaton has 9552 states and 11149 transitions. Word has length 205 [2024-11-20 00:11:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 9552 states and 11149 transitions. [2024-11-20 00:11:40,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:11:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 9552 states and 11149 transitions. [2024-11-20 00:11:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 00:11:40,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:40,232 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:40,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 00:11:40,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:40,433 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:40,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash 997545003, now seen corresponding path program 1 times [2024-11-20 00:11:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:40,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196304015] [2024-11-20 00:11:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 00:11:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 00:11:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 56 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-20 00:11:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196304015] [2024-11-20 00:11:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196304015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271222936] [2024-11-20 00:11:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:40,561 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:40,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 00:11:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:40,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-20 00:11:40,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271222936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:40,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023380431] [2024-11-20 00:11:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:40,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:40,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:40,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:40,766 INFO L87 Difference]: Start difference. First operand 9552 states and 11149 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 00:11:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:41,449 INFO L93 Difference]: Finished difference Result 16218 states and 19184 transitions. [2024-11-20 00:11:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 206 [2024-11-20 00:11:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:41,482 INFO L225 Difference]: With dead ends: 16218 [2024-11-20 00:11:41,482 INFO L226 Difference]: Without dead ends: 9574 [2024-11-20 00:11:41,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:41,495 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:41,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9574 states. [2024-11-20 00:11:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9574 to 9550. [2024-11-20 00:11:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9550 states, 8223 states have (on average 1.1430134987230938) internal successors, (9399), 8297 states have internal predecessors, (9399), 688 states have call successors, (688), 541 states have call predecessors, (688), 638 states have return successors, (913), 712 states have call predecessors, (913), 688 states have call successors, (913) [2024-11-20 00:11:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9550 states to 9550 states and 11000 transitions. [2024-11-20 00:11:42,236 INFO L78 Accepts]: Start accepts. Automaton has 9550 states and 11000 transitions. Word has length 206 [2024-11-20 00:11:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:42,236 INFO L471 AbstractCegarLoop]: Abstraction has 9550 states and 11000 transitions. [2024-11-20 00:11:42,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 00:11:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 9550 states and 11000 transitions. [2024-11-20 00:11:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-20 00:11:42,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:42,241 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:42,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 00:11:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:42,442 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash -646628265, now seen corresponding path program 1 times [2024-11-20 00:11:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943499374] [2024-11-20 00:11:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-20 00:11:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 00:11:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 00:11:42,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943499374] [2024-11-20 00:11:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943499374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:42,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:42,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180604778] [2024-11-20 00:11:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:42,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:42,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:42,678 INFO L87 Difference]: Start difference. First operand 9550 states and 11000 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:45,713 INFO L93 Difference]: Finished difference Result 33406 states and 39371 transitions. [2024-11-20 00:11:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 00:11:45,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 208 [2024-11-20 00:11:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:45,788 INFO L225 Difference]: With dead ends: 33406 [2024-11-20 00:11:45,788 INFO L226 Difference]: Without dead ends: 27792 [2024-11-20 00:11:45,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:45,807 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 958 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:45,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1012 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2024-11-20 00:11:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 20169. [2024-11-20 00:11:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20169 states, 17356 states have (on average 1.1526849504494123) internal successors, (20006), 17515 states have internal predecessors, (20006), 1460 states have call successors, (1460), 1137 states have call predecessors, (1460), 1352 states have return successors, (2001), 1517 states have call predecessors, (2001), 1460 states have call successors, (2001) [2024-11-20 00:11:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 23467 transitions. [2024-11-20 00:11:47,720 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 23467 transitions. Word has length 208 [2024-11-20 00:11:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 20169 states and 23467 transitions. [2024-11-20 00:11:47,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-20 00:11:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 23467 transitions. [2024-11-20 00:11:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-20 00:11:47,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:47,736 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:47,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-20 00:11:47,736 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:47,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1159435551, now seen corresponding path program 1 times [2024-11-20 00:11:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:47,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032310815] [2024-11-20 00:11:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-20 00:11:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 00:11:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-20 00:11:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-20 00:11:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 00:11:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-20 00:11:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-20 00:11:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-20 00:11:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-20 00:11:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-11-20 00:11:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-20 00:11:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 67 proven. 12 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-20 00:11:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032310815] [2024-11-20 00:11:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032310815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945471779] [2024-11-20 00:11:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:47,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:47,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 00:11:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:48,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 00:11:48,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-20 00:11:48,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945471779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:48,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:48,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2024-11-20 00:11:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030439715] [2024-11-20 00:11:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:48,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:48,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:48,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:48,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:48,201 INFO L87 Difference]: Start difference. First operand 20169 states and 23467 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 00:11:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:48,681 INFO L93 Difference]: Finished difference Result 23548 states and 27308 transitions. [2024-11-20 00:11:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:11:48,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 334 [2024-11-20 00:11:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:48,712 INFO L225 Difference]: With dead ends: 23548 [2024-11-20 00:11:48,712 INFO L226 Difference]: Without dead ends: 3392 [2024-11-20 00:11:48,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:48,740 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:48,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 860 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2024-11-20 00:11:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3336. [2024-11-20 00:11:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 2888 states have (on average 1.1204986149584488) internal successors, (3236), 2901 states have internal predecessors, (3236), 221 states have call successors, (221), 173 states have call predecessors, (221), 226 states have return successors, (311), 261 states have call predecessors, (311), 221 states have call successors, (311) [2024-11-20 00:11:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 3768 transitions. [2024-11-20 00:11:49,077 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 3768 transitions. Word has length 334 [2024-11-20 00:11:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:49,078 INFO L471 AbstractCegarLoop]: Abstraction has 3336 states and 3768 transitions. [2024-11-20 00:11:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 00:11:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 3768 transitions. [2024-11-20 00:11:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-20 00:11:49,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:49,083 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 00:11:49,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 00:11:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:49,284 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:49,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2140866478, now seen corresponding path program 1 times [2024-11-20 00:11:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11480816] [2024-11-20 00:11:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-20 00:11:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 00:11:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 00:11:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-20 00:11:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-20 00:11:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-20 00:11:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-20 00:11:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-20 00:11:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-20 00:11:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-20 00:11:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-20 00:11:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-11-20 00:11:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11480816] [2024-11-20 00:11:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11480816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684184689] [2024-11-20 00:11:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:49,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:49,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 00:11:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:49,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 00:11:49,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-20 00:11:49,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684184689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:49,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:49,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-20 00:11:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491147940] [2024-11-20 00:11:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:49,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:49,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:49,703 INFO L87 Difference]: Start difference. First operand 3336 states and 3768 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 00:11:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:49,987 INFO L93 Difference]: Finished difference Result 6016 states and 6865 transitions. [2024-11-20 00:11:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:11:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 340 [2024-11-20 00:11:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:50,006 INFO L225 Difference]: With dead ends: 6016 [2024-11-20 00:11:50,007 INFO L226 Difference]: Without dead ends: 3192 [2024-11-20 00:11:50,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:50,010 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:50,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2024-11-20 00:11:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3192. [2024-11-20 00:11:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 2753 states have (on average 1.1231383944787505) internal successors, (3092), 2757 states have internal predecessors, (3092), 221 states have call successors, (221), 173 states have call predecessors, (221), 217 states have return successors, (302), 261 states have call predecessors, (302), 221 states have call successors, (302) [2024-11-20 00:11:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 3615 transitions. [2024-11-20 00:11:50,260 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 3615 transitions. Word has length 340 [2024-11-20 00:11:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:50,261 INFO L471 AbstractCegarLoop]: Abstraction has 3192 states and 3615 transitions. [2024-11-20 00:11:50,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 00:11:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 3615 transitions. [2024-11-20 00:11:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-20 00:11:50,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:50,265 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:50,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 00:11:50,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-20 00:11:50,466 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:50,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1133813714, now seen corresponding path program 2 times [2024-11-20 00:11:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000118930] [2024-11-20 00:11:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:11:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 00:11:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 00:11:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-20 00:11:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-20 00:11:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-20 00:11:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 00:11:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-20 00:11:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-20 00:11:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-20 00:11:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-20 00:11:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-20 00:11:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-11-20 00:11:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-20 00:11:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 112 proven. 40 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-11-20 00:11:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000118930] [2024-11-20 00:11:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000118930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672605250] [2024-11-20 00:11:50,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 00:11:50,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:50,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:50,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:50,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 00:11:50,791 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 00:11:50,791 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 00:11:50,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:50,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-20 00:11:50,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672605250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-20 00:11:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126047911] [2024-11-20 00:11:50,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:50,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:50,816 INFO L87 Difference]: Start difference. First operand 3192 states and 3615 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 00:11:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:51,019 INFO L93 Difference]: Finished difference Result 4805 states and 5454 transitions. [2024-11-20 00:11:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 341 [2024-11-20 00:11:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:51,034 INFO L225 Difference]: With dead ends: 4805 [2024-11-20 00:11:51,034 INFO L226 Difference]: Without dead ends: 2125 [2024-11-20 00:11:51,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:51,037 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 22 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:51,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-20 00:11:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1998. [2024-11-20 00:11:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1730 states have (on average 1.1092485549132949) internal successors, (1919), 1736 states have internal predecessors, (1919), 133 states have call successors, (133), 109 states have call predecessors, (133), 134 states have return successors, (172), 152 states have call predecessors, (172), 133 states have call successors, (172) [2024-11-20 00:11:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2224 transitions. [2024-11-20 00:11:51,192 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2224 transitions. Word has length 341 [2024-11-20 00:11:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:51,192 INFO L471 AbstractCegarLoop]: Abstraction has 1998 states and 2224 transitions. [2024-11-20 00:11:51,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 00:11:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2224 transitions. [2024-11-20 00:11:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-20 00:11:51,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:51,197 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:51,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:51,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-20 00:11:51,398 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:51,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1506952644, now seen corresponding path program 1 times [2024-11-20 00:11:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998396175] [2024-11-20 00:11:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 00:11:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:11:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 00:11:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 00:11:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 00:11:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 00:11:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-20 00:11:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-20 00:11:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-20 00:11:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-20 00:11:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-20 00:11:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-20 00:11:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-20 00:11:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-20 00:11:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-20 00:11:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-20 00:11:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 49 proven. 33 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-20 00:11:51,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:51,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998396175] [2024-11-20 00:11:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998396175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:51,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179899385] [2024-11-20 00:11:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:51,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:51,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:51,679 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:51,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 00:11:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 00:11:51,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-20 00:11:51,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:11:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179899385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:11:51,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-20 00:11:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518942647] [2024-11-20 00:11:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:51,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:11:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:11:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:51,912 INFO L87 Difference]: Start difference. First operand 1998 states and 2224 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-20 00:11:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:52,081 INFO L93 Difference]: Finished difference Result 3327 states and 3780 transitions. [2024-11-20 00:11:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:11:52,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 372 [2024-11-20 00:11:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:52,100 INFO L225 Difference]: With dead ends: 3327 [2024-11-20 00:11:52,100 INFO L226 Difference]: Without dead ends: 2267 [2024-11-20 00:11:52,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:52,102 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 129 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:52,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:11:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2024-11-20 00:11:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2267. [2024-11-20 00:11:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 1959 states have (on average 1.104134762633997) internal successors, (2163), 1965 states have internal predecessors, (2163), 153 states have call successors, (153), 129 states have call predecessors, (153), 154 states have return successors, (213), 172 states have call predecessors, (213), 153 states have call successors, (213) [2024-11-20 00:11:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 2529 transitions. [2024-11-20 00:11:52,335 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 2529 transitions. Word has length 372 [2024-11-20 00:11:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:52,336 INFO L471 AbstractCegarLoop]: Abstraction has 2267 states and 2529 transitions. [2024-11-20 00:11:52,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-20 00:11:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2529 transitions. [2024-11-20 00:11:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-20 00:11:52,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:52,341 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:52,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-20 00:11:52,542 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:52,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1416892354, now seen corresponding path program 1 times [2024-11-20 00:11:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311796350] [2024-11-20 00:11:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 00:11:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:11:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 00:11:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 00:11:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 00:11:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 00:11:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-20 00:11:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-20 00:11:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-20 00:11:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-20 00:11:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-20 00:11:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-20 00:11:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-20 00:11:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-20 00:11:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-20 00:11:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-20 00:11:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2024-11-20 00:11:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311796350] [2024-11-20 00:11:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311796350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:52,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:52,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160955160] [2024-11-20 00:11:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:52,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:52,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:52,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:52,759 INFO L87 Difference]: Start difference. First operand 2267 states and 2529 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-20 00:11:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:53,301 INFO L93 Difference]: Finished difference Result 4271 states and 4823 transitions. [2024-11-20 00:11:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:11:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 372 [2024-11-20 00:11:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:53,318 INFO L225 Difference]: With dead ends: 4271 [2024-11-20 00:11:53,319 INFO L226 Difference]: Without dead ends: 2411 [2024-11-20 00:11:53,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:11:53,321 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 358 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:53,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 575 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 00:11:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2024-11-20 00:11:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2267. [2024-11-20 00:11:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 1959 states have (on average 1.0985196528841246) internal successors, (2152), 1965 states have internal predecessors, (2152), 153 states have call successors, (153), 129 states have call predecessors, (153), 154 states have return successors, (213), 172 states have call predecessors, (213), 153 states have call successors, (213) [2024-11-20 00:11:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 2518 transitions. [2024-11-20 00:11:53,524 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 2518 transitions. Word has length 372 [2024-11-20 00:11:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:53,525 INFO L471 AbstractCegarLoop]: Abstraction has 2267 states and 2518 transitions. [2024-11-20 00:11:53,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-20 00:11:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2518 transitions. [2024-11-20 00:11:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-20 00:11:53,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:53,529 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-20 00:11:53,529 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1920158466, now seen corresponding path program 1 times [2024-11-20 00:11:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:53,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427700656] [2024-11-20 00:11:53,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:11:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:11:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:11:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 00:11:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:11:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:11:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 00:11:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 00:11:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 00:11:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 00:11:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-20 00:11:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-20 00:11:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-20 00:11:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-20 00:11:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-20 00:11:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-20 00:11:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-20 00:11:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-20 00:11:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-20 00:11:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-20 00:11:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-20 00:11:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 62 proven. 15 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2024-11-20 00:11:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427700656] [2024-11-20 00:11:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427700656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:11:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939409365] [2024-11-20 00:11:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:11:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:53,725 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:11:53,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 00:11:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:53,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 00:11:53,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:11:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 359 proven. 4 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-20 00:11:54,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:11:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 56 proven. 16 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-20 00:11:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939409365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:11:54,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:11:54,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 5] total 13 [2024-11-20 00:11:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161986852] [2024-11-20 00:11:54,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:11:54,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 00:11:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 00:11:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:11:54,553 INFO L87 Difference]: Start difference. First operand 2267 states and 2518 transitions. Second operand has 13 states, 13 states have (on average 28.384615384615383) internal successors, (369), 10 states have internal predecessors, (369), 5 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2024-11-20 00:11:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:55,196 INFO L93 Difference]: Finished difference Result 2816 states and 3105 transitions. [2024-11-20 00:11:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 00:11:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 28.384615384615383) internal successors, (369), 10 states have internal predecessors, (369), 5 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) Word has length 372 [2024-11-20 00:11:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:55,209 INFO L225 Difference]: With dead ends: 2816 [2024-11-20 00:11:55,209 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 00:11:55,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 792 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2024-11-20 00:11:55,212 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 266 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:55,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 685 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:11:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 00:11:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 00:11:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 00:11:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 00:11:55,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 372 [2024-11-20 00:11:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:55,223 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 00:11:55,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.384615384615383) internal successors, (369), 10 states have internal predecessors, (369), 5 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2024-11-20 00:11:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 00:11:55,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 00:11:55,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-20 00:11:55,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-20 00:11:55,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-20 00:11:55,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-20 00:11:55,430 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:55,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.