./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:04:26,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:04:26,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:04:26,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:04:26,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:04:26,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:04:26,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:04:26,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:04:26,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:04:26,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:04:26,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:04:26,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:04:26,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:04:26,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:04:26,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:04:26,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:04:26,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:04:26,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:04:26,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:04:26,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:04:26,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:04:26,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:04:26,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:04:26,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:04:26,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:04:26,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:04:26,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:04:26,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:04:26,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:04:26,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:04:26,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:04:26,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:04:26,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:04:26,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:04:26,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:04:26,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:04:26,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:04:26,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:04:26,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:04:26,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:04:26,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:04:26,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:04:26,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 [2024-10-11 05:04:27,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:04:27,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:04:27,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:04:27,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:04:27,250 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:04:27,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2024-10-11 05:04:28,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:04:29,125 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:04:29,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2024-10-11 05:04:29,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b6a812d21/16e9671e3eba4aa7b86e33fe33d65659/FLAGf0670d5bd [2024-10-11 05:04:29,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b6a812d21/16e9671e3eba4aa7b86e33fe33d65659 [2024-10-11 05:04:29,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:04:29,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:04:29,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:04:29,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:04:29,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:04:29,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c6a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29, skipping insertion in model container [2024-10-11 05:04:29,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:04:29,436 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[914,927] [2024-10-11 05:04:29,556 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2024-10-11 05:04:29,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:04:29,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:04:29,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[914,927] [2024-10-11 05:04:29,779 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2024-10-11 05:04:29,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:04:29,868 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:04:29,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29 WrapperNode [2024-10-11 05:04:29,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:04:29,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:04:29,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:04:29,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:04:29,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,950 INFO L138 Inliner]: procedures = 75, calls = 90, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 1008 [2024-10-11 05:04:29,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:04:29,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:04:29,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:04:29,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:04:29,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:29,999 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:04:30,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:04:30,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:04:30,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:04:30,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:04:30,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (1/1) ... [2024-10-11 05:04:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:04:30,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:30,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:04:30,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:04:30,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:04:30,178 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:04:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:04:30,178 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:04:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:04:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:04:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:04:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:04:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:04:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:04:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:04:30,181 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:04:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:04:30,181 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:04:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:04:30,181 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:04:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:04:30,181 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:04:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:04:30,181 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:04:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:04:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:04:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:04:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:04:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:04:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:04:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:04:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:04:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:04:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:04:30,183 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:04:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:04:30,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:04:30,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:04:31,424 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 05:04:31,425 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:04:31,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:04:31,513 INFO L314 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-11 05:04:31,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:04:31 BoogieIcfgContainer [2024-10-11 05:04:31,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:04:31,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:04:31,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:04:31,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:04:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:04:29" (1/3) ... [2024-10-11 05:04:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb193d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:04:31, skipping insertion in model container [2024-10-11 05:04:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:29" (2/3) ... [2024-10-11 05:04:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb193d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:04:31, skipping insertion in model container [2024-10-11 05:04:31,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:04:31" (3/3) ... [2024-10-11 05:04:31,525 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2024-10-11 05:04:31,543 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:04:31,543 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:04:31,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:04:31,637 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;@1b147b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:04:31,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:04:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 416 states, 360 states have (on average 1.711111111111111) internal successors, (616), 366 states have internal predecessors, (616), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 05:04:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:31,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:31,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:31,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1868577869, now seen corresponding path program 1 times [2024-10-11 05:04:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147960656] [2024-10-11 05:04:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147960656] [2024-10-11 05:04:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147960656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583289617] [2024-10-11 05:04:32,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:32,396 INFO L87 Difference]: Start difference. First operand has 416 states, 360 states have (on average 1.711111111111111) internal successors, (616), 366 states have internal predecessors, (616), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:34,022 INFO L93 Difference]: Finished difference Result 933 states and 1541 transitions. [2024-10-11 05:04:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:04:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:34,044 INFO L225 Difference]: With dead ends: 933 [2024-10-11 05:04:34,044 INFO L226 Difference]: Without dead ends: 536 [2024-10-11 05:04:34,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:34,053 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1097 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:34,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1667 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:04:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-11 05:04:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 499. [2024-10-11 05:04:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 425 states have (on average 1.576470588235294) internal successors, (670), 431 states have internal predecessors, (670), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-10-11 05:04:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 773 transitions. [2024-10-11 05:04:34,177 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 773 transitions. Word has length 58 [2024-10-11 05:04:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:34,178 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 773 transitions. [2024-10-11 05:04:34,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 773 transitions. [2024-10-11 05:04:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:34,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:34,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:04:34,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1335227380, now seen corresponding path program 1 times [2024-10-11 05:04:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762400570] [2024-10-11 05:04:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762400570] [2024-10-11 05:04:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762400570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851162100] [2024-10-11 05:04:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:34,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:34,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:34,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:34,437 INFO L87 Difference]: Start difference. First operand 499 states and 773 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:35,931 INFO L93 Difference]: Finished difference Result 819 states and 1223 transitions. [2024-10-11 05:04:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:04:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:04:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:35,937 INFO L225 Difference]: With dead ends: 819 [2024-10-11 05:04:35,938 INFO L226 Difference]: Without dead ends: 657 [2024-10-11 05:04:35,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:04:35,940 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1296 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:35,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 1887 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-11 05:04:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 587. [2024-10-11 05:04:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 493 states have (on average 1.5537525354969575) internal successors, (766), 501 states have internal predecessors, (766), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2024-10-11 05:04:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 899 transitions. [2024-10-11 05:04:36,008 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 899 transitions. Word has length 58 [2024-10-11 05:04:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:36,010 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 899 transitions. [2024-10-11 05:04:36,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 899 transitions. [2024-10-11 05:04:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:36,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:36,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:36,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:04:36,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:36,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1031467214, now seen corresponding path program 1 times [2024-10-11 05:04:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69414077] [2024-10-11 05:04:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69414077] [2024-10-11 05:04:36,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69414077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:36,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:36,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:36,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438385728] [2024-10-11 05:04:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:36,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:36,222 INFO L87 Difference]: Start difference. First operand 587 states and 899 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:37,663 INFO L93 Difference]: Finished difference Result 861 states and 1285 transitions. [2024-10-11 05:04:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:04:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:37,671 INFO L225 Difference]: With dead ends: 861 [2024-10-11 05:04:37,672 INFO L226 Difference]: Without dead ends: 617 [2024-10-11 05:04:37,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:04:37,676 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 572 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:37,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 2277 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-11 05:04:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2024-10-11 05:04:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 496 states have (on average 1.5463709677419355) internal successors, (767), 504 states have internal predecessors, (767), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2024-10-11 05:04:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 901 transitions. [2024-10-11 05:04:37,736 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 901 transitions. Word has length 58 [2024-10-11 05:04:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:37,737 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 901 transitions. [2024-10-11 05:04:37,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 901 transitions. [2024-10-11 05:04:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:37,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:37,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:37,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:04:37,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1019516784, now seen corresponding path program 1 times [2024-10-11 05:04:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775616944] [2024-10-11 05:04:37,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775616944] [2024-10-11 05:04:37,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775616944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:37,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:37,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:04:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063954140] [2024-10-11 05:04:37,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:37,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:04:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:37,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:04:37,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:37,958 INFO L87 Difference]: Start difference. First operand 591 states and 901 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:04:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:40,002 INFO L93 Difference]: Finished difference Result 1815 states and 2599 transitions. [2024-10-11 05:04:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:04:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:04:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:40,014 INFO L225 Difference]: With dead ends: 1815 [2024-10-11 05:04:40,014 INFO L226 Difference]: Without dead ends: 1549 [2024-10-11 05:04:40,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:04:40,018 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 3653 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3667 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:40,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3667 Valid, 1804 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:04:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2024-10-11 05:04:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1426. [2024-10-11 05:04:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1145 states have (on average 1.4323144104803494) internal successors, (1640), 1168 states have internal predecessors, (1640), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2024-10-11 05:04:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1976 transitions. [2024-10-11 05:04:40,136 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1976 transitions. Word has length 58 [2024-10-11 05:04:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:40,140 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1976 transitions. [2024-10-11 05:04:40,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:04:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1976 transitions. [2024-10-11 05:04:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:40,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:40,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:40,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:04:40,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1375629654, now seen corresponding path program 1 times [2024-10-11 05:04:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:40,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136958525] [2024-10-11 05:04:40,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:40,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136958525] [2024-10-11 05:04:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136958525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100216384] [2024-10-11 05:04:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:40,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:40,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:40,282 INFO L87 Difference]: Start difference. First operand 1426 states and 1976 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:41,647 INFO L93 Difference]: Finished difference Result 2615 states and 3547 transitions. [2024-10-11 05:04:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:04:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-11 05:04:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:41,658 INFO L225 Difference]: With dead ends: 2615 [2024-10-11 05:04:41,659 INFO L226 Difference]: Without dead ends: 1520 [2024-10-11 05:04:41,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:41,665 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 576 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:41,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 2274 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:04:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-10-11 05:04:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1450. [2024-10-11 05:04:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1163 states have (on average 1.418744625967326) internal successors, (1650), 1186 states have internal predecessors, (1650), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2024-10-11 05:04:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1992 transitions. [2024-10-11 05:04:41,769 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1992 transitions. Word has length 59 [2024-10-11 05:04:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:41,770 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1992 transitions. [2024-10-11 05:04:41,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1992 transitions. [2024-10-11 05:04:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:41,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:41,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:41,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:04:41,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 547598380, now seen corresponding path program 1 times [2024-10-11 05:04:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24995263] [2024-10-11 05:04:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24995263] [2024-10-11 05:04:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24995263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639340938] [2024-10-11 05:04:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:41,992 INFO L87 Difference]: Start difference. First operand 1450 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:43,380 INFO L93 Difference]: Finished difference Result 2600 states and 3434 transitions. [2024-10-11 05:04:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:04:43,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-11 05:04:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:43,391 INFO L225 Difference]: With dead ends: 2600 [2024-10-11 05:04:43,391 INFO L226 Difference]: Without dead ends: 1688 [2024-10-11 05:04:43,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:04:43,397 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1576 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:43,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 1392 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:04:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-10-11 05:04:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1395. [2024-10-11 05:04:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1124 states have (on average 1.416370106761566) internal successors, (1592), 1142 states have internal predecessors, (1592), 143 states have call successors, (143), 106 states have call predecessors, (143), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2024-10-11 05:04:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1913 transitions. [2024-10-11 05:04:43,515 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1913 transitions. Word has length 59 [2024-10-11 05:04:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:43,516 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1913 transitions. [2024-10-11 05:04:43,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1913 transitions. [2024-10-11 05:04:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:43,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:43,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:43,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:04:43,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:43,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 766453098, now seen corresponding path program 1 times [2024-10-11 05:04:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255355053] [2024-10-11 05:04:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255355053] [2024-10-11 05:04:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255355053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468146054] [2024-10-11 05:04:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:43,650 INFO L87 Difference]: Start difference. First operand 1395 states and 1913 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:44,608 INFO L93 Difference]: Finished difference Result 3544 states and 4684 transitions. [2024-10-11 05:04:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:04:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 05:04:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:44,622 INFO L225 Difference]: With dead ends: 3544 [2024-10-11 05:04:44,623 INFO L226 Difference]: Without dead ends: 2481 [2024-10-11 05:04:44,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:04:44,628 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1249 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:44,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1374 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:04:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2024-10-11 05:04:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2365. [2024-10-11 05:04:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1851 states have (on average 1.3457590491626148) internal successors, (2491), 1886 states have internal predecessors, (2491), 262 states have call successors, (262), 205 states have call predecessors, (262), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) [2024-10-11 05:04:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3122 transitions. [2024-10-11 05:04:44,831 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3122 transitions. Word has length 59 [2024-10-11 05:04:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:44,831 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3122 transitions. [2024-10-11 05:04:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:04:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3122 transitions. [2024-10-11 05:04:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:04:44,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:44,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:04:44,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1327163791, now seen corresponding path program 1 times [2024-10-11 05:04:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825813958] [2024-10-11 05:04:44,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825813958] [2024-10-11 05:04:44,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825813958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:44,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:44,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160943172] [2024-10-11 05:04:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:44,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:44,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:44,908 INFO L87 Difference]: Start difference. First operand 2365 states and 3122 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:45,888 INFO L93 Difference]: Finished difference Result 5417 states and 7003 transitions. [2024-10-11 05:04:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-11 05:04:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:45,909 INFO L225 Difference]: With dead ends: 5417 [2024-10-11 05:04:45,910 INFO L226 Difference]: Without dead ends: 3389 [2024-10-11 05:04:45,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:45,918 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1067 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:45,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1112 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:04:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2024-10-11 05:04:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3131. [2024-10-11 05:04:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 2431 states have (on average 1.3237350884409709) internal successors, (3218), 2471 states have internal predecessors, (3218), 354 states have call successors, (354), 285 states have call predecessors, (354), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) [2024-10-11 05:04:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4055 transitions. [2024-10-11 05:04:46,196 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4055 transitions. Word has length 60 [2024-10-11 05:04:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:46,198 INFO L471 AbstractCegarLoop]: Abstraction has 3131 states and 4055 transitions. [2024-10-11 05:04:46,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4055 transitions. [2024-10-11 05:04:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:04:46,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:46,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:46,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:04:46,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2050925680, now seen corresponding path program 1 times [2024-10-11 05:04:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261021118] [2024-10-11 05:04:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:46,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:46,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261021118] [2024-10-11 05:04:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261021118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:46,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288424327] [2024-10-11 05:04:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:46,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:46,289 INFO L87 Difference]: Start difference. First operand 3131 states and 4055 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:47,248 INFO L93 Difference]: Finished difference Result 6695 states and 8521 transitions. [2024-10-11 05:04:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-11 05:04:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:47,274 INFO L225 Difference]: With dead ends: 6695 [2024-10-11 05:04:47,275 INFO L226 Difference]: Without dead ends: 3899 [2024-10-11 05:04:47,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:47,285 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1221 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:47,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1174 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2024-10-11 05:04:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3635. [2024-10-11 05:04:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3635 states, 2821 states have (on average 1.3144275079758951) internal successors, (3708), 2865 states have internal predecessors, (3708), 410 states have call successors, (410), 335 states have call predecessors, (410), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) [2024-10-11 05:04:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4674 transitions. [2024-10-11 05:04:47,606 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4674 transitions. Word has length 66 [2024-10-11 05:04:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:47,606 INFO L471 AbstractCegarLoop]: Abstraction has 3635 states and 4674 transitions. [2024-10-11 05:04:47,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4674 transitions. [2024-10-11 05:04:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:04:47,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:47,611 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:47,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:04:47,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:47,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 328945416, now seen corresponding path program 1 times [2024-10-11 05:04:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74514685] [2024-10-11 05:04:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74514685] [2024-10-11 05:04:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74514685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836019886] [2024-10-11 05:04:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:47,714 INFO L87 Difference]: Start difference. First operand 3635 states and 4674 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:04:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:48,763 INFO L93 Difference]: Finished difference Result 4643 states and 5891 transitions. [2024-10-11 05:04:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:04:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-11 05:04:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:48,789 INFO L225 Difference]: With dead ends: 4643 [2024-10-11 05:04:48,790 INFO L226 Difference]: Without dead ends: 4640 [2024-10-11 05:04:48,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:04:48,793 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1831 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:48,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 1148 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2024-10-11 05:04:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4055. [2024-10-11 05:04:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 3134 states have (on average 1.3024888321633694) internal successors, (4082), 3181 states have internal predecessors, (4082), 460 states have call successors, (460), 379 states have call predecessors, (460), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) [2024-10-11 05:04:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5175 transitions. [2024-10-11 05:04:49,283 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5175 transitions. Word has length 67 [2024-10-11 05:04:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:49,283 INFO L471 AbstractCegarLoop]: Abstraction has 4055 states and 5175 transitions. [2024-10-11 05:04:49,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:04:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5175 transitions. [2024-10-11 05:04:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:04:49,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:49,285 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:49,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:04:49,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:49,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1606001370, now seen corresponding path program 1 times [2024-10-11 05:04:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594300072] [2024-10-11 05:04:49,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594300072] [2024-10-11 05:04:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594300072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30252535] [2024-10-11 05:04:49,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:49,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:49,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:49,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:04:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:04:49,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:49,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:04:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30252535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:04:49,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:04:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:04:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737634816] [2024-10-11 05:04:49,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:04:49,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:04:49,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:04:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:49,949 INFO L87 Difference]: Start difference. First operand 4055 states and 5175 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:04:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:52,177 INFO L93 Difference]: Finished difference Result 8027 states and 10038 transitions. [2024-10-11 05:04:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 05:04:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-11 05:04:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:52,221 INFO L225 Difference]: With dead ends: 8027 [2024-10-11 05:04:52,222 INFO L226 Difference]: Without dead ends: 8024 [2024-10-11 05:04:52,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2024-10-11 05:04:52,227 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 2258 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2321 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:52,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2321 Valid, 1950 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:04:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8024 states. [2024-10-11 05:04:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8024 to 7172. [2024-10-11 05:04:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 5509 states have (on average 1.28244690506444) internal successors, (7065), 5591 states have internal predecessors, (7065), 819 states have call successors, (819), 693 states have call predecessors, (819), 842 states have return successors, (1134), 890 states have call predecessors, (1134), 818 states have call successors, (1134) [2024-10-11 05:04:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 9018 transitions. [2024-10-11 05:04:53,096 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 9018 transitions. Word has length 68 [2024-10-11 05:04:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:53,097 INFO L471 AbstractCegarLoop]: Abstraction has 7172 states and 9018 transitions. [2024-10-11 05:04:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:04:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 9018 transitions. [2024-10-11 05:04:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:04:53,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:53,100 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:53,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:04:53,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:04:53,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:53,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1185476104, now seen corresponding path program 2 times [2024-10-11 05:04:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300773151] [2024-10-11 05:04:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300773151] [2024-10-11 05:04:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300773151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003835567] [2024-10-11 05:04:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:53,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:53,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:53,382 INFO L87 Difference]: Start difference. First operand 7172 states and 9018 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:04:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:54,322 INFO L93 Difference]: Finished difference Result 9560 states and 12021 transitions. [2024-10-11 05:04:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:04:54,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-11 05:04:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:54,349 INFO L225 Difference]: With dead ends: 9560 [2024-10-11 05:04:54,350 INFO L226 Difference]: Without dead ends: 3922 [2024-10-11 05:04:54,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:54,365 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 1450 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:54,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 940 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2024-10-11 05:04:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 2986. [2024-10-11 05:04:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2329 states have (on average 1.2958351223701159) internal successors, (3018), 2357 states have internal predecessors, (3018), 338 states have call successors, (338), 275 states have call predecessors, (338), 317 states have return successors, (433), 356 states have call predecessors, (433), 337 states have call successors, (433) [2024-10-11 05:04:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3789 transitions. [2024-10-11 05:04:54,764 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3789 transitions. Word has length 71 [2024-10-11 05:04:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:54,765 INFO L471 AbstractCegarLoop]: Abstraction has 2986 states and 3789 transitions. [2024-10-11 05:04:54,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:04:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3789 transitions. [2024-10-11 05:04:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:04:54,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:54,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:54,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:04:54,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:54,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash 507445231, now seen corresponding path program 1 times [2024-10-11 05:04:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99798003] [2024-10-11 05:04:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:04:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99798003] [2024-10-11 05:04:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99798003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982480159] [2024-10-11 05:04:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:54,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:54,907 INFO L87 Difference]: Start difference. First operand 2986 states and 3789 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:04:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:56,443 INFO L93 Difference]: Finished difference Result 8304 states and 10320 transitions. [2024-10-11 05:04:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:04:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-11 05:04:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:56,481 INFO L225 Difference]: With dead ends: 8304 [2024-10-11 05:04:56,481 INFO L226 Difference]: Without dead ends: 4914 [2024-10-11 05:04:56,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:04:56,491 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1700 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:56,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1469 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2024-10-11 05:04:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4654. [2024-10-11 05:04:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 3562 states have (on average 1.2549129702414374) internal successors, (4470), 3627 states have internal predecessors, (4470), 538 states have call successors, (538), 447 states have call predecessors, (538), 552 states have return successors, (783), 582 states have call predecessors, (783), 537 states have call successors, (783) [2024-10-11 05:04:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 5791 transitions. [2024-10-11 05:04:57,168 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 5791 transitions. Word has length 76 [2024-10-11 05:04:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:57,169 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 5791 transitions. [2024-10-11 05:04:57,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:04:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 5791 transitions. [2024-10-11 05:04:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:04:57,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:57,172 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:57,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:04:57,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:57,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1205276563, now seen corresponding path program 1 times [2024-10-11 05:04:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513547960] [2024-10-11 05:04:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:04:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513547960] [2024-10-11 05:04:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513547960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:57,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148665884] [2024-10-11 05:04:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:57,329 INFO L87 Difference]: Start difference. First operand 4654 states and 5791 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:04:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:58,936 INFO L93 Difference]: Finished difference Result 7744 states and 9539 transitions. [2024-10-11 05:04:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:04:58,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-11 05:04:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:58,956 INFO L225 Difference]: With dead ends: 7744 [2024-10-11 05:04:58,956 INFO L226 Difference]: Without dead ends: 3901 [2024-10-11 05:04:58,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:04:58,966 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1765 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:58,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 1738 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states. [2024-10-11 05:04:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 3497. [2024-10-11 05:04:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3497 states, 2671 states have (on average 1.2456008985398728) internal successors, (3327), 2724 states have internal predecessors, (3327), 403 states have call successors, (403), 329 states have call predecessors, (403), 421 states have return successors, (552), 446 states have call predecessors, (552), 402 states have call successors, (552) [2024-10-11 05:04:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 4282 transitions. [2024-10-11 05:04:59,330 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 4282 transitions. Word has length 86 [2024-10-11 05:04:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:59,331 INFO L471 AbstractCegarLoop]: Abstraction has 3497 states and 4282 transitions. [2024-10-11 05:04:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:04:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 4282 transitions. [2024-10-11 05:04:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:04:59,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:59,335 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:59,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:04:59,335 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:59,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1256397690, now seen corresponding path program 1 times [2024-10-11 05:04:59,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635086104] [2024-10-11 05:04:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:04:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:04:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:04:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:04:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:04:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 05:04:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 05:04:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:59,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635086104] [2024-10-11 05:04:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635086104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552267141] [2024-10-11 05:04:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:59,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:59,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:59,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:59,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:04:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:04:59,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 05:04:59,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:59,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552267141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:59,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:59,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 05:04:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001748981] [2024-10-11 05:04:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:04:59,707 INFO L87 Difference]: Start difference. First operand 3497 states and 4282 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:04:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:59,987 INFO L93 Difference]: Finished difference Result 5088 states and 6190 transitions. [2024-10-11 05:04:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:04:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-11 05:04:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:59,997 INFO L225 Difference]: With dead ends: 5088 [2024-10-11 05:04:59,998 INFO L226 Difference]: Without dead ends: 1928 [2024-10-11 05:05:00,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:05:00,006 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:00,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2968 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:05:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-10-11 05:05:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928. [2024-10-11 05:05:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1548 states have (on average 1.2751937984496124) internal successors, (1974), 1564 states have internal predecessors, (1974), 192 states have call successors, (192), 143 states have call predecessors, (192), 186 states have return successors, (259), 221 states have call predecessors, (259), 191 states have call successors, (259) [2024-10-11 05:05:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2425 transitions. [2024-10-11 05:05:00,186 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2425 transitions. Word has length 131 [2024-10-11 05:05:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:00,187 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2425 transitions. [2024-10-11 05:05:00,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:05:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2425 transitions. [2024-10-11 05:05:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 05:05:00,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:00,191 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:00,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 05:05:00,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 05:05:00,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:00,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:00,392 INFO L85 PathProgramCache]: Analyzing trace with hash 100794176, now seen corresponding path program 1 times [2024-10-11 05:05:00,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:00,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126716775] [2024-10-11 05:05:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:05:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 05:05:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:05:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:05:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 05:05:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:05:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:05:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 05:05:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126716775] [2024-10-11 05:05:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126716775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330307270] [2024-10-11 05:05:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:00,488 INFO L87 Difference]: Start difference. First operand 1928 states and 2425 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 05:05:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:01,160 INFO L93 Difference]: Finished difference Result 1976 states and 2475 transitions. [2024-10-11 05:05:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:01,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2024-10-11 05:05:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:01,171 INFO L225 Difference]: With dead ends: 1976 [2024-10-11 05:05:01,171 INFO L226 Difference]: Without dead ends: 1636 [2024-10-11 05:05:01,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:05:01,174 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 675 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:01,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1316 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:05:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-10-11 05:05:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1591. [2024-10-11 05:05:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1295 states have (on average 1.2988416988416989) internal successors, (1682), 1308 states have internal predecessors, (1682), 151 states have call successors, (151), 108 states have call predecessors, (151), 143 states have return successors, (204), 175 states have call predecessors, (204), 150 states have call successors, (204) [2024-10-11 05:05:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2037 transitions. [2024-10-11 05:05:01,327 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2037 transitions. Word has length 133 [2024-10-11 05:05:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2037 transitions. [2024-10-11 05:05:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 05:05:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2037 transitions. [2024-10-11 05:05:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:05:01,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:01,331 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:05:01,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1510841032, now seen corresponding path program 1 times [2024-10-11 05:05:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497846588] [2024-10-11 05:05:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:05:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:05:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:05:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:05:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:05:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:05:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 05:05:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:01,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497846588] [2024-10-11 05:05:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497846588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:01,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924348871] [2024-10-11 05:05:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:01,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:01,454 INFO L87 Difference]: Start difference. First operand 1591 states and 2037 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:05:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:02,526 INFO L93 Difference]: Finished difference Result 2742 states and 3421 transitions. [2024-10-11 05:05:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:05:02,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-11 05:05:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:02,534 INFO L225 Difference]: With dead ends: 2742 [2024-10-11 05:05:02,534 INFO L226 Difference]: Without dead ends: 1571 [2024-10-11 05:05:02,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:02,537 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 607 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:02,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1723 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:05:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-10-11 05:05:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1490. [2024-10-11 05:05:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1218 states have (on average 1.3095238095238095) internal successors, (1595), 1231 states have internal predecessors, (1595), 139 states have call successors, (139), 98 states have call predecessors, (139), 131 states have return successors, (186), 161 states have call predecessors, (186), 138 states have call successors, (186) [2024-10-11 05:05:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1920 transitions. [2024-10-11 05:05:02,665 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1920 transitions. Word has length 145 [2024-10-11 05:05:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:02,665 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1920 transitions. [2024-10-11 05:05:02,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:05:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1920 transitions. [2024-10-11 05:05:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 05:05:02,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:02,668 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:02,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:05:02,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash -353123848, now seen corresponding path program 1 times [2024-10-11 05:05:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467228271] [2024-10-11 05:05:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:05:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:05:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:05:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:05:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:05:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:05:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:05:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 05:05:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467228271] [2024-10-11 05:05:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467228271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:05:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000071858] [2024-10-11 05:05:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:02,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:05:02,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:05:02,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:05:02,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:05:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:03,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 05:05:03,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:05:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 05:05:03,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:05:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 05:05:03,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000071858] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:05:03,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:05:03,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 05:05:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807713296] [2024-10-11 05:05:03,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:05:03,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 05:05:03,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 05:05:03,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:05:03,492 INFO L87 Difference]: Start difference. First operand 1490 states and 1920 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:05:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:04,885 INFO L93 Difference]: Finished difference Result 3081 states and 3914 transitions. [2024-10-11 05:05:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 05:05:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-11 05:05:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:04,894 INFO L225 Difference]: With dead ends: 3081 [2024-10-11 05:05:04,894 INFO L226 Difference]: Without dead ends: 1858 [2024-10-11 05:05:04,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-11 05:05:04,898 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1849 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:04,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 1778 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:05:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-10-11 05:05:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1750. [2024-10-11 05:05:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1403 states have (on average 1.2687099073414112) internal successors, (1780), 1417 states have internal predecessors, (1780), 179 states have call successors, (179), 136 states have call predecessors, (179), 166 states have return successors, (255), 197 states have call predecessors, (255), 178 states have call successors, (255) [2024-10-11 05:05:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2214 transitions. [2024-10-11 05:05:05,182 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2214 transitions. Word has length 147 [2024-10-11 05:05:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:05,183 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2214 transitions. [2024-10-11 05:05:05,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:05:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2214 transitions. [2024-10-11 05:05:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:05,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:05,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:05,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:05:05,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:05:05,391 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -267558593, now seen corresponding path program 1 times [2024-10-11 05:05:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487474301] [2024-10-11 05:05:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487474301] [2024-10-11 05:05:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487474301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:05,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:05:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278255429] [2024-10-11 05:05:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:05,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:05:05,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:05:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:05:05,625 INFO L87 Difference]: Start difference. First operand 1750 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:07,614 INFO L93 Difference]: Finished difference Result 2188 states and 2946 transitions. [2024-10-11 05:05:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-11 05:05:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:07,624 INFO L225 Difference]: With dead ends: 2188 [2024-10-11 05:05:07,624 INFO L226 Difference]: Without dead ends: 1870 [2024-10-11 05:05:07,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:07,626 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 999 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:07,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 785 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:05:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-10-11 05:05:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1750. [2024-10-11 05:05:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1403 states have (on average 1.2679971489665003) internal successors, (1779), 1417 states have internal predecessors, (1779), 179 states have call successors, (179), 136 states have call predecessors, (179), 166 states have return successors, (255), 197 states have call predecessors, (255), 178 states have call successors, (255) [2024-10-11 05:05:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2213 transitions. [2024-10-11 05:05:07,954 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2213 transitions. Word has length 151 [2024-10-11 05:05:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2213 transitions. [2024-10-11 05:05:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2213 transitions. [2024-10-11 05:05:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:07,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:07,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:07,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:05:07,959 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:07,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash -605846143, now seen corresponding path program 1 times [2024-10-11 05:05:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888653608] [2024-10-11 05:05:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:08,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:08,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888653608] [2024-10-11 05:05:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888653608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:08,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:08,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:05:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455153705] [2024-10-11 05:05:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:08,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:05:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:05:08,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:05:08,121 INFO L87 Difference]: Start difference. First operand 1750 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:09,938 INFO L93 Difference]: Finished difference Result 2180 states and 2929 transitions. [2024-10-11 05:05:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:09,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-11 05:05:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:09,947 INFO L225 Difference]: With dead ends: 2180 [2024-10-11 05:05:09,948 INFO L226 Difference]: Without dead ends: 1870 [2024-10-11 05:05:09,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:09,950 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 990 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:09,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 783 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:05:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-10-11 05:05:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1750. [2024-10-11 05:05:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1403 states have (on average 1.2672843905915894) internal successors, (1778), 1417 states have internal predecessors, (1778), 179 states have call successors, (179), 136 states have call predecessors, (179), 166 states have return successors, (255), 197 states have call predecessors, (255), 178 states have call successors, (255) [2024-10-11 05:05:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2212 transitions. [2024-10-11 05:05:10,277 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2212 transitions. Word has length 151 [2024-10-11 05:05:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:10,277 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2212 transitions. [2024-10-11 05:05:10,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2212 transitions. [2024-10-11 05:05:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:10,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:10,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:10,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:05:10,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1023734845, now seen corresponding path program 1 times [2024-10-11 05:05:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524274849] [2024-10-11 05:05:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:10,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524274849] [2024-10-11 05:05:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524274849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:10,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656681569] [2024-10-11 05:05:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:10,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:10,493 INFO L87 Difference]: Start difference. First operand 1750 states and 2212 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:13,227 INFO L93 Difference]: Finished difference Result 2619 states and 3664 transitions. [2024-10-11 05:05:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:05:13,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:13,235 INFO L225 Difference]: With dead ends: 2619 [2024-10-11 05:05:13,235 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 05:05:13,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:13,237 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1566 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:13,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1161 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:05:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 05:05:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2074. [2024-10-11 05:05:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1700 states have (on average 1.3335294117647059) internal successors, (2267), 1715 states have internal predecessors, (2267), 199 states have call successors, (199), 142 states have call predecessors, (199), 173 states have return successors, (278), 217 states have call predecessors, (278), 198 states have call successors, (278) [2024-10-11 05:05:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2744 transitions. [2024-10-11 05:05:13,585 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2744 transitions. Word has length 151 [2024-10-11 05:05:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:13,585 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 2744 transitions. [2024-10-11 05:05:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2744 transitions. [2024-10-11 05:05:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:13,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:13,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:13,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:05:13,588 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:13,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1144960697, now seen corresponding path program 1 times [2024-10-11 05:05:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:13,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541966691] [2024-10-11 05:05:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:13,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:13,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541966691] [2024-10-11 05:05:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541966691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:13,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:13,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117058641] [2024-10-11 05:05:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:13,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:13,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:13,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:13,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:13,832 INFO L87 Difference]: Start difference. First operand 2074 states and 2744 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:17,326 INFO L93 Difference]: Finished difference Result 3404 states and 4966 transitions. [2024-10-11 05:05:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:17,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:17,339 INFO L225 Difference]: With dead ends: 3404 [2024-10-11 05:05:17,339 INFO L226 Difference]: Without dead ends: 2774 [2024-10-11 05:05:17,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:17,344 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 1609 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 3691 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:17,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 2083 Invalid, 3784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3691 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 05:05:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2024-10-11 05:05:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2373. [2024-10-11 05:05:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1972 states have (on average 1.372210953346856) internal successors, (2706), 1988 states have internal predecessors, (2706), 219 states have call successors, (219), 148 states have call predecessors, (219), 180 states have return successors, (300), 238 states have call predecessors, (300), 218 states have call successors, (300) [2024-10-11 05:05:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3225 transitions. [2024-10-11 05:05:17,766 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3225 transitions. Word has length 151 [2024-10-11 05:05:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:17,767 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3225 transitions. [2024-10-11 05:05:17,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3225 transitions. [2024-10-11 05:05:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:17,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:17,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:17,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:05:17,770 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:17,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash -469800571, now seen corresponding path program 1 times [2024-10-11 05:05:17,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022426342] [2024-10-11 05:05:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:17,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022426342] [2024-10-11 05:05:17,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022426342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:17,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:17,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753176193] [2024-10-11 05:05:17,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:17,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:17,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:17,986 INFO L87 Difference]: Start difference. First operand 2373 states and 3225 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:19,781 INFO L93 Difference]: Finished difference Result 3719 states and 5485 transitions. [2024-10-11 05:05:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:19,795 INFO L225 Difference]: With dead ends: 3719 [2024-10-11 05:05:19,795 INFO L226 Difference]: Without dead ends: 2790 [2024-10-11 05:05:19,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:19,800 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1389 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:19,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 985 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:05:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2024-10-11 05:05:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2373. [2024-10-11 05:05:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1972 states have (on average 1.3706896551724137) internal successors, (2703), 1988 states have internal predecessors, (2703), 219 states have call successors, (219), 148 states have call predecessors, (219), 180 states have return successors, (300), 238 states have call predecessors, (300), 218 states have call successors, (300) [2024-10-11 05:05:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3222 transitions. [2024-10-11 05:05:20,315 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3222 transitions. Word has length 151 [2024-10-11 05:05:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:20,315 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3222 transitions. [2024-10-11 05:05:20,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3222 transitions. [2024-10-11 05:05:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:20,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:20,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:05:20,318 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1054572221, now seen corresponding path program 1 times [2024-10-11 05:05:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259780228] [2024-10-11 05:05:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259780228] [2024-10-11 05:05:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259780228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585307149] [2024-10-11 05:05:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:20,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:20,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:20,540 INFO L87 Difference]: Start difference. First operand 2373 states and 3222 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:22,276 INFO L93 Difference]: Finished difference Result 3715 states and 5468 transitions. [2024-10-11 05:05:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:22,286 INFO L225 Difference]: With dead ends: 3715 [2024-10-11 05:05:22,287 INFO L226 Difference]: Without dead ends: 2786 [2024-10-11 05:05:22,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:22,290 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1387 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:22,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 985 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:05:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2024-10-11 05:05:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2373. [2024-10-11 05:05:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1972 states have (on average 1.3691683569979716) internal successors, (2700), 1988 states have internal predecessors, (2700), 219 states have call successors, (219), 148 states have call predecessors, (219), 180 states have return successors, (300), 238 states have call predecessors, (300), 218 states have call successors, (300) [2024-10-11 05:05:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3219 transitions. [2024-10-11 05:05:22,683 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3219 transitions. Word has length 151 [2024-10-11 05:05:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:22,683 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3219 transitions. [2024-10-11 05:05:22,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3219 transitions. [2024-10-11 05:05:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:22,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:22,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:22,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:05:22,687 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:22,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1489077819, now seen corresponding path program 1 times [2024-10-11 05:05:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84413489] [2024-10-11 05:05:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84413489] [2024-10-11 05:05:22,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84413489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:22,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302085760] [2024-10-11 05:05:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:22,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:22,924 INFO L87 Difference]: Start difference. First operand 2373 states and 3219 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:24,629 INFO L93 Difference]: Finished difference Result 3711 states and 5451 transitions. [2024-10-11 05:05:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:24,640 INFO L225 Difference]: With dead ends: 3711 [2024-10-11 05:05:24,640 INFO L226 Difference]: Without dead ends: 2782 [2024-10-11 05:05:24,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:24,643 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1385 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:24,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 985 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:05:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2024-10-11 05:05:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2373. [2024-10-11 05:05:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1972 states have (on average 1.3676470588235294) internal successors, (2697), 1988 states have internal predecessors, (2697), 219 states have call successors, (219), 148 states have call predecessors, (219), 180 states have return successors, (300), 238 states have call predecessors, (300), 218 states have call successors, (300) [2024-10-11 05:05:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3216 transitions. [2024-10-11 05:05:25,026 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3216 transitions. Word has length 151 [2024-10-11 05:05:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:25,026 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3216 transitions. [2024-10-11 05:05:25,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3216 transitions. [2024-10-11 05:05:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:25,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:25,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:25,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:05:25,030 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:25,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1918736125, now seen corresponding path program 1 times [2024-10-11 05:05:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508995052] [2024-10-11 05:05:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508995052] [2024-10-11 05:05:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508995052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250865639] [2024-10-11 05:05:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:25,254 INFO L87 Difference]: Start difference. First operand 2373 states and 3216 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:28,802 INFO L93 Difference]: Finished difference Result 4541 states and 6795 transitions. [2024-10-11 05:05:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:28,821 INFO L225 Difference]: With dead ends: 4541 [2024-10-11 05:05:28,821 INFO L226 Difference]: Without dead ends: 3612 [2024-10-11 05:05:28,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:28,826 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1580 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 3602 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:28,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 2081 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3602 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 05:05:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2024-10-11 05:05:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 2984. [2024-10-11 05:05:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2529 states have (on average 1.4187425860023726) internal successors, (3588), 2547 states have internal predecessors, (3588), 259 states have call successors, (259), 160 states have call predecessors, (259), 194 states have return successors, (348), 280 states have call predecessors, (348), 258 states have call successors, (348) [2024-10-11 05:05:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4195 transitions. [2024-10-11 05:05:29,179 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4195 transitions. Word has length 151 [2024-10-11 05:05:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:29,179 INFO L471 AbstractCegarLoop]: Abstraction has 2984 states and 4195 transitions. [2024-10-11 05:05:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4195 transitions. [2024-10-11 05:05:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:29,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:29,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:29,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:05:29,183 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:29,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1669634565, now seen corresponding path program 1 times [2024-10-11 05:05:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928322886] [2024-10-11 05:05:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:29,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:29,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928322886] [2024-10-11 05:05:29,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928322886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:29,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:29,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864152925] [2024-10-11 05:05:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:29,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:29,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:29,398 INFO L87 Difference]: Start difference. First operand 2984 states and 4195 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:31,642 INFO L93 Difference]: Finished difference Result 5139 states and 7762 transitions. [2024-10-11 05:05:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:31,657 INFO L225 Difference]: With dead ends: 5139 [2024-10-11 05:05:31,657 INFO L226 Difference]: Without dead ends: 3599 [2024-10-11 05:05:31,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:31,664 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1196 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:31,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1179 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:05:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2024-10-11 05:05:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2984. [2024-10-11 05:05:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2529 states have (on average 1.4167655199683669) internal successors, (3583), 2547 states have internal predecessors, (3583), 259 states have call successors, (259), 160 states have call predecessors, (259), 194 states have return successors, (348), 280 states have call predecessors, (348), 258 states have call successors, (348) [2024-10-11 05:05:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4190 transitions. [2024-10-11 05:05:32,062 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4190 transitions. Word has length 151 [2024-10-11 05:05:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 2984 states and 4190 transitions. [2024-10-11 05:05:32,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4190 transitions. [2024-10-11 05:05:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:32,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:32,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:05:32,087 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1678294845, now seen corresponding path program 1 times [2024-10-11 05:05:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623936801] [2024-10-11 05:05:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:32,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623936801] [2024-10-11 05:05:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623936801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948761409] [2024-10-11 05:05:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:32,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:32,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:32,333 INFO L87 Difference]: Start difference. First operand 2984 states and 4190 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:35,975 INFO L93 Difference]: Finished difference Result 6746 states and 10350 transitions. [2024-10-11 05:05:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:35,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 05:05:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:35,992 INFO L225 Difference]: With dead ends: 6746 [2024-10-11 05:05:35,992 INFO L226 Difference]: Without dead ends: 5206 [2024-10-11 05:05:35,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:35,998 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1572 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 3564 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:35,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 2081 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3564 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 05:05:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2024-10-11 05:05:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 4206. [2024-10-11 05:05:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 3643 states have (on average 1.4699423552017568) internal successors, (5355), 3665 states have internal predecessors, (5355), 339 states have call successors, (339), 184 states have call predecessors, (339), 222 states have return successors, (450), 364 states have call predecessors, (450), 338 states have call successors, (450) [2024-10-11 05:05:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6144 transitions. [2024-10-11 05:05:36,448 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6144 transitions. Word has length 151 [2024-10-11 05:05:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:36,448 INFO L471 AbstractCegarLoop]: Abstraction has 4206 states and 6144 transitions. [2024-10-11 05:05:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6144 transitions. [2024-10-11 05:05:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:05:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:36,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:36,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:05:36,453 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash -816461243, now seen corresponding path program 1 times [2024-10-11 05:05:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:36,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171558777] [2024-10-11 05:05:36,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:36,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:05:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:05:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:05:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:36,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171558777] [2024-10-11 05:05:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171558777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279784722] [2024-10-11 05:05:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:36,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:36,691 INFO L87 Difference]: Start difference. First operand 4206 states and 6144 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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)