./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme --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 bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:24,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:24,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:47:24,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:24,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:24,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:24,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:24,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:24,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:24,911 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:24,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:24,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:24,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:24,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:24,917 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:24,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:24,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:47:24,919 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:24,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:47:24,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:24,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:24,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:47:24,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:24,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:47:24,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:24,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:47:24,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:24,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:24,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:24,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:24,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:24,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:24,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:24,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:24,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:47:24,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:47:24,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:47:24,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:24,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:24,929 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:47:24,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:24,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:24,930 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme 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 -> bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 [2023-11-26 11:47:25,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:25,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:25,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:25,242 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:25,242 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:25,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2023-11-26 11:47:28,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:28,642 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:28,643 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2023-11-26 11:47:28,656 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/data/00f28deae/3b9107a405064a21bf6c941368cdd2a6/FLAG5c56acd0d [2023-11-26 11:47:28,673 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/data/00f28deae/3b9107a405064a21bf6c941368cdd2a6 [2023-11-26 11:47:28,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:28,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:28,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:28,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:28,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:28,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:28" (1/1) ... [2023-11-26 11:47:28,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5340e456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:28, skipping insertion in model container [2023-11-26 11:47:28,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:28" (1/1) ... [2023-11-26 11:47:28,719 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:28,873 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i[916,929] [2023-11-26 11:47:28,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:28,952 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:28,964 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i[916,929] [2023-11-26 11:47:28,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:29,028 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:29,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29 WrapperNode [2023-11-26 11:47:29,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:29,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:29,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:29,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:29,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,104 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2023-11-26 11:47:29,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:29,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:29,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:29,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:29,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,176 INFO L175 MemorySlicer]: Split 87 memory accesses to 2 slices as follows [2, 85]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 14 writes are split as follows [0, 14]. [2023-11-26 11:47:29,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:29,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:29,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:29,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:29,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (1/1) ... [2023-11-26 11:47:29,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:29,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:29,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:47:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:47:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:47:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:47:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:47:29,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:47:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:47:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:29,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:29,456 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:29,458 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:29,944 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:29,990 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:29,990 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:47:29,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:29 BoogieIcfgContainer [2023-11-26 11:47:29,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:29,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:29,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:30,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:30,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:28" (1/3) ... [2023-11-26 11:47:30,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ece679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:30, skipping insertion in model container [2023-11-26 11:47:30,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:29" (2/3) ... [2023-11-26 11:47:30,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ece679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:30, skipping insertion in model container [2023-11-26 11:47:30,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:29" (3/3) ... [2023-11-26 11:47:30,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-62.i [2023-11-26 11:47:30,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:30,030 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:30,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:30,085 INFO L357 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, mHoare=true, 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;@4b11189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:30,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-26 11:47:30,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:30,107 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:30,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:30,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1354780057, now seen corresponding path program 1 times [2023-11-26 11:47:30,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:30,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259568793] [2023-11-26 11:47:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259568793] [2023-11-26 11:47:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259568793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:30,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887794116] [2023-11-26 11:47:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:30,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:30,576 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:30,631 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-11-26 11:47:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-11-26 11:47:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:30,644 INFO L225 Difference]: With dead ends: 129 [2023-11-26 11:47:30,645 INFO L226 Difference]: Without dead ends: 64 [2023-11-26 11:47:30,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:30,654 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:30,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-26 11:47:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-26 11:47:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-11-26 11:47:30,710 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-11-26 11:47:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:30,711 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-11-26 11:47:30,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-11-26 11:47:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-26 11:47:30,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:30,715 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:30,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:47:30,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:30,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1294320009, now seen corresponding path program 1 times [2023-11-26 11:47:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79766380] [2023-11-26 11:47:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:31,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79766380] [2023-11-26 11:47:31,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79766380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:47:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054957221] [2023-11-26 11:47:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:31,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:31,122 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:31,225 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2023-11-26 11:47:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:47:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-26 11:47:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:31,231 INFO L225 Difference]: With dead ends: 135 [2023-11-26 11:47:31,232 INFO L226 Difference]: Without dead ends: 72 [2023-11-26 11:47:31,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:31,234 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:31,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-26 11:47:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-11-26 11:47:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2023-11-26 11:47:31,252 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2023-11-26 11:47:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:31,254 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2023-11-26 11:47:31,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2023-11-26 11:47:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-26 11:47:31,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:31,257 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:31,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:47:31,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:31,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1351578311, now seen corresponding path program 1 times [2023-11-26 11:47:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862691972] [2023-11-26 11:47:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:31,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862691972] [2023-11-26 11:47:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862691972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:31,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:31,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:47:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875122640] [2023-11-26 11:47:31,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:31,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:31,393 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:31,433 INFO L93 Difference]: Finished difference Result 135 states and 192 transitions. [2023-11-26 11:47:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:47:31,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-26 11:47:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:31,436 INFO L225 Difference]: With dead ends: 135 [2023-11-26 11:47:31,437 INFO L226 Difference]: Without dead ends: 70 [2023-11-26 11:47:31,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:31,439 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:31,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-26 11:47:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-11-26 11:47:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2023-11-26 11:47:31,450 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2023-11-26 11:47:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:31,451 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2023-11-26 11:47:31,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2023-11-26 11:47:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-26 11:47:31,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:31,454 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:31,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:47:31,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:31,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1351637893, now seen corresponding path program 1 times [2023-11-26 11:47:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:31,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565324309] [2023-11-26 11:47:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565324309] [2023-11-26 11:47:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565324309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:47:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098037807] [2023-11-26 11:47:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:32,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:32,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:32,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:32,003 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:32,182 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2023-11-26 11:47:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:47:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-26 11:47:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:32,188 INFO L225 Difference]: With dead ends: 160 [2023-11-26 11:47:32,189 INFO L226 Difference]: Without dead ends: 93 [2023-11-26 11:47:32,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:32,199 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 82 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:32,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 172 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:47:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-26 11:47:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2023-11-26 11:47:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2023-11-26 11:47:32,215 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2023-11-26 11:47:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:32,216 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2023-11-26 11:47:32,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2023-11-26 11:47:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-26 11:47:32,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:32,223 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:32,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:47:32,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:32,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash -561595094, now seen corresponding path program 1 times [2023-11-26 11:47:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672082705] [2023-11-26 11:47:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672082705] [2023-11-26 11:47:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672082705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433541208] [2023-11-26 11:47:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:32,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:32,527 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:32,868 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2023-11-26 11:47:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:47:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-11-26 11:47:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:32,872 INFO L225 Difference]: With dead ends: 228 [2023-11-26 11:47:32,873 INFO L226 Difference]: Without dead ends: 161 [2023-11-26 11:47:32,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:47:32,875 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 199 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:32,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 360 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-26 11:47:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 78. [2023-11-26 11:47:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-11-26 11:47:32,890 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2023-11-26 11:47:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:32,890 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-11-26 11:47:32,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-11-26 11:47:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-26 11:47:32,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:32,893 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:32,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:47:32,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:32,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash -119192321, now seen corresponding path program 1 times [2023-11-26 11:47:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560855296] [2023-11-26 11:47:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560855296] [2023-11-26 11:47:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560855296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751708205] [2023-11-26 11:47:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:33,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:33,046 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:33,096 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2023-11-26 11:47:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-11-26 11:47:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:33,098 INFO L225 Difference]: With dead ends: 171 [2023-11-26 11:47:33,099 INFO L226 Difference]: Without dead ends: 94 [2023-11-26 11:47:33,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:47:33,100 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:33,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-26 11:47:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2023-11-26 11:47:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2023-11-26 11:47:33,108 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 72 [2023-11-26 11:47:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:33,109 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2023-11-26 11:47:33,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2023-11-26 11:47:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-26 11:47:33,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:33,111 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:33,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:47:33,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:33,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1965214734, now seen corresponding path program 1 times [2023-11-26 11:47:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:33,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824584409] [2023-11-26 11:47:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:33,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824584409] [2023-11-26 11:47:33,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824584409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923961867] [2023-11-26 11:47:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:33,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:33,904 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:34,209 INFO L93 Difference]: Finished difference Result 221 states and 302 transitions. [2023-11-26 11:47:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2023-11-26 11:47:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:34,212 INFO L225 Difference]: With dead ends: 221 [2023-11-26 11:47:34,212 INFO L226 Difference]: Without dead ends: 141 [2023-11-26 11:47:34,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:47:34,214 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:34,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-26 11:47:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 81. [2023-11-26 11:47:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2023-11-26 11:47:34,223 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2023-11-26 11:47:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:34,224 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2023-11-26 11:47:34,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2023-11-26 11:47:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-26 11:47:34,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:34,226 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:34,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:47:34,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:34,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1929324996, now seen corresponding path program 1 times [2023-11-26 11:47:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:34,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576207988] [2023-11-26 11:47:34,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576207988] [2023-11-26 11:47:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576207988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:35,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:35,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911981023] [2023-11-26 11:47:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:35,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:35,501 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:35,850 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2023-11-26 11:47:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:35,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2023-11-26 11:47:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:35,853 INFO L225 Difference]: With dead ends: 192 [2023-11-26 11:47:35,853 INFO L226 Difference]: Without dead ends: 112 [2023-11-26 11:47:35,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:47:35,854 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 81 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:35,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 331 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-26 11:47:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2023-11-26 11:47:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2023-11-26 11:47:35,864 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2023-11-26 11:47:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:35,864 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2023-11-26 11:47:35,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2023-11-26 11:47:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-26 11:47:35,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:35,866 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:35,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:47:35,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:35,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1720932689, now seen corresponding path program 1 times [2023-11-26 11:47:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471287444] [2023-11-26 11:47:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471287444] [2023-11-26 11:47:36,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471287444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:36,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:36,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956246273] [2023-11-26 11:47:36,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:36,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:36,084 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:36,191 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2023-11-26 11:47:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:47:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-11-26 11:47:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:36,194 INFO L225 Difference]: With dead ends: 191 [2023-11-26 11:47:36,194 INFO L226 Difference]: Without dead ends: 111 [2023-11-26 11:47:36,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:47:36,196 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 80 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:36,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 410 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:47:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-26 11:47:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 82. [2023-11-26 11:47:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2023-11-26 11:47:36,203 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 74 [2023-11-26 11:47:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:36,204 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2023-11-26 11:47:36,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2023-11-26 11:47:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-26 11:47:36,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:36,205 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:36,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:47:36,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:36,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1127619112, now seen corresponding path program 1 times [2023-11-26 11:47:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:36,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315992281] [2023-11-26 11:47:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:47:37,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315992281] [2023-11-26 11:47:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315992281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850852959] [2023-11-26 11:47:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:37,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:47:37,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:37,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:47:37,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:47:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-26 11:47:37,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:37,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:37,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-11-26 11:47:37,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:37,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 36 [2023-11-26 11:47:37,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:37,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 39 [2023-11-26 11:47:37,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:37,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2023-11-26 11:47:37,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2023-11-26 11:47:38,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:38,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 19 [2023-11-26 11:47:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-26 11:47:38,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:39,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:39,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 1 [2023-11-26 11:47:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:47:39,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850852959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:47:39,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:47:39,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 30 [2023-11-26 11:47:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498946284] [2023-11-26 11:47:39,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:47:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-26 11:47:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-26 11:47:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2023-11-26 11:47:39,310 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 30 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 30 states have internal predecessors, (96), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-26 11:47:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:42,830 INFO L93 Difference]: Finished difference Result 287 states and 378 transitions. [2023-11-26 11:47:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-26 11:47:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 30 states have internal predecessors, (96), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 8 states have call successors, (16) Word has length 74 [2023-11-26 11:47:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:42,833 INFO L225 Difference]: With dead ends: 287 [2023-11-26 11:47:42,834 INFO L226 Difference]: Without dead ends: 206 [2023-11-26 11:47:42,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=759, Invalid=3531, Unknown=0, NotChecked=0, Total=4290 [2023-11-26 11:47:42,838 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 520 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:42,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 413 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-26 11:47:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-26 11:47:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 86. [2023-11-26 11:47:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2023-11-26 11:47:42,852 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 74 [2023-11-26 11:47:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:42,852 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-11-26 11:47:42,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 30 states have internal predecessors, (96), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-26 11:47:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2023-11-26 11:47:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 11:47:42,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:42,855 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:42,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:47:43,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-26 11:47:43,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:43,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -690505933, now seen corresponding path program 1 times [2023-11-26 11:47:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:43,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118573299] [2023-11-26 11:47:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118573299] [2023-11-26 11:47:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118573299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:43,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846016819] [2023-11-26 11:47:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:43,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:43,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:43,310 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:43,530 INFO L93 Difference]: Finished difference Result 192 states and 249 transitions. [2023-11-26 11:47:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:47:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-26 11:47:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:43,533 INFO L225 Difference]: With dead ends: 192 [2023-11-26 11:47:43,533 INFO L226 Difference]: Without dead ends: 107 [2023-11-26 11:47:43,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:43,535 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:43,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 181 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:47:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-26 11:47:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2023-11-26 11:47:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-11-26 11:47:43,547 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 75 [2023-11-26 11:47:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:43,548 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-11-26 11:47:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-11-26 11:47:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 11:47:43,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:43,550 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:43,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:47:43,550 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:43,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -176075441, now seen corresponding path program 1 times [2023-11-26 11:47:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:43,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032187640] [2023-11-26 11:47:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032187640] [2023-11-26 11:47:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032187640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:44,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:44,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027312355] [2023-11-26 11:47:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:44,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:44,231 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:44,568 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2023-11-26 11:47:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:47:44,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-26 11:47:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:44,571 INFO L225 Difference]: With dead ends: 263 [2023-11-26 11:47:44,571 INFO L226 Difference]: Without dead ends: 174 [2023-11-26 11:47:44,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:47:44,573 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 113 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:44,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 334 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-26 11:47:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 99. [2023-11-26 11:47:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2023-11-26 11:47:44,586 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 75 [2023-11-26 11:47:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:44,586 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2023-11-26 11:47:44,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2023-11-26 11:47:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 11:47:44,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:44,588 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:44,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:47:44,589 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:44,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash 835041809, now seen corresponding path program 1 times [2023-11-26 11:47:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:44,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486119885] [2023-11-26 11:47:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:46,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486119885] [2023-11-26 11:47:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486119885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:46,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:46,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 11:47:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286617293] [2023-11-26 11:47:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:46,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:47:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:46,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:47:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:47:46,151 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:46,993 INFO L93 Difference]: Finished difference Result 241 states and 303 transitions. [2023-11-26 11:47:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:47:46,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-26 11:47:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:46,996 INFO L225 Difference]: With dead ends: 241 [2023-11-26 11:47:46,996 INFO L226 Difference]: Without dead ends: 143 [2023-11-26 11:47:46,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:47:46,999 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 182 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:46,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 747 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:47:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-26 11:47:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 100. [2023-11-26 11:47:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.25) internal successors, (110), 88 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2023-11-26 11:47:47,016 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 75 [2023-11-26 11:47:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:47,017 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2023-11-26 11:47:47,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2023-11-26 11:47:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 11:47:47,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:47,019 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:47,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:47:47,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:47,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash 42779277, now seen corresponding path program 1 times [2023-11-26 11:47:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:47,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462915615] [2023-11-26 11:47:47,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:48,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462915615] [2023-11-26 11:47:48,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462915615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-26 11:47:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177927968] [2023-11-26 11:47:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:48,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 11:47:48,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:48,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 11:47:48,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-26 11:47:48,783 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:51,061 INFO L93 Difference]: Finished difference Result 626 states and 780 transitions. [2023-11-26 11:47:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-26 11:47:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2023-11-26 11:47:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:51,066 INFO L225 Difference]: With dead ends: 626 [2023-11-26 11:47:51,066 INFO L226 Difference]: Without dead ends: 527 [2023-11-26 11:47:51,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=536, Invalid=2116, Unknown=0, NotChecked=0, Total=2652 [2023-11-26 11:47:51,069 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 882 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:51,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 771 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-26 11:47:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-11-26 11:47:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 213. [2023-11-26 11:47:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 190 states have (on average 1.263157894736842) internal successors, (240), 190 states have internal predecessors, (240), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:47:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2023-11-26 11:47:51,096 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 272 transitions. Word has length 75 [2023-11-26 11:47:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:51,097 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 272 transitions. [2023-11-26 11:47:51,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2023-11-26 11:47:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 11:47:51,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:51,099 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:51,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:47:51,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:51,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1053896527, now seen corresponding path program 1 times [2023-11-26 11:47:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514236983] [2023-11-26 11:47:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514236983] [2023-11-26 11:47:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514236983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:51,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:47:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120723965] [2023-11-26 11:47:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:51,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:47:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:47:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:47:51,644 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:51,962 INFO L93 Difference]: Finished difference Result 511 states and 648 transitions. [2023-11-26 11:47:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:47:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2023-11-26 11:47:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:51,965 INFO L225 Difference]: With dead ends: 511 [2023-11-26 11:47:51,966 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 11:47:51,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:47:51,969 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 82 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:51,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 400 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 11:47:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 213. [2023-11-26 11:47:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 190 states have internal predecessors, (236), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:47:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2023-11-26 11:47:52,007 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 75 [2023-11-26 11:47:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:52,010 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2023-11-26 11:47:52,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2023-11-26 11:47:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-26 11:47:52,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:52,015 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:52,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:47:52,016 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:52,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1308603953, now seen corresponding path program 1 times [2023-11-26 11:47:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024273214] [2023-11-26 11:47:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:47:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024273214] [2023-11-26 11:47:53,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024273214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:53,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481812624] [2023-11-26 11:47:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:53,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:47:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:53,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:47:53,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:47:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-26 11:47:53,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:54,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2023-11-26 11:47:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-11-26 11:47:54,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-11-26 11:47:54,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:54,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 40 [2023-11-26 11:47:54,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:54,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2023-11-26 11:47:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:47:54,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481812624] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:54,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:47:54,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 11] total 30 [2023-11-26 11:47:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457650310] [2023-11-26 11:47:54,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:54,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:47:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:47:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2023-11-26 11:47:54,922 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:55,726 INFO L93 Difference]: Finished difference Result 511 states and 640 transitions. [2023-11-26 11:47:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:47:55,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-11-26 11:47:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:55,730 INFO L225 Difference]: With dead ends: 511 [2023-11-26 11:47:55,730 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 11:47:55,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2023-11-26 11:47:55,733 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 177 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:55,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 631 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 11:47:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 11:47:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 96. [2023-11-26 11:47:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 84 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2023-11-26 11:47:55,755 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 76 [2023-11-26 11:47:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:55,756 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2023-11-26 11:47:55,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2023-11-26 11:47:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-26 11:47:55,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:55,758 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:55,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:47:55,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2aec239-5c88-47fe-81d1-2aa3a6760c59/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-26 11:47:55,966 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:55,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1658149489, now seen corresponding path program 1 times [2023-11-26 11:47:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242495416] [2023-11-26 11:47:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:56,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242495416] [2023-11-26 11:47:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242495416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67678825] [2023-11-26 11:47:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:56,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:56,225 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:56,445 INFO L93 Difference]: Finished difference Result 243 states and 302 transitions. [2023-11-26 11:47:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:56,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-26 11:47:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:56,447 INFO L225 Difference]: With dead ends: 243 [2023-11-26 11:47:56,448 INFO L226 Difference]: Without dead ends: 148 [2023-11-26 11:47:56,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:56,449 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:56,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 221 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:47:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-26 11:47:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2023-11-26 11:47:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.198019801980198) internal successors, (121), 101 states have internal predecessors, (121), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2023-11-26 11:47:56,464 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 77 [2023-11-26 11:47:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:56,465 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2023-11-26 11:47:56,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2023-11-26 11:47:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-26 11:47:56,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:56,467 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:56,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:47:56,467 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:56,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1159926853, now seen corresponding path program 1 times [2023-11-26 11:47:56,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:56,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578002630] [2023-11-26 11:47:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:56,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578002630] [2023-11-26 11:47:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578002630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:56,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:56,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663524551] [2023-11-26 11:47:56,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:56,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:56,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:56,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:56,666 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:56,912 INFO L93 Difference]: Finished difference Result 277 states and 338 transitions. [2023-11-26 11:47:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-26 11:47:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:56,916 INFO L225 Difference]: With dead ends: 277 [2023-11-26 11:47:56,916 INFO L226 Difference]: Without dead ends: 162 [2023-11-26 11:47:56,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:56,917 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 94 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:56,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 296 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:47:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-26 11:47:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 110. [2023-11-26 11:47:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 98 states have internal predecessors, (117), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 11:47:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2023-11-26 11:47:56,934 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 77 [2023-11-26 11:47:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:56,935 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2023-11-26 11:47:56,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2023-11-26 11:47:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-26 11:47:56,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:56,937 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:56,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:47:56,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:56,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1835022753, now seen corresponding path program 1 times [2023-11-26 11:47:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:56,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602268815] [2023-11-26 11:47:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602268815] [2023-11-26 11:47:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602268815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:47:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338426235] [2023-11-26 11:47:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:57,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:47:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:47:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:47:57,878 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:58,795 INFO L93 Difference]: Finished difference Result 324 states and 396 transitions. [2023-11-26 11:47:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-26 11:47:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2023-11-26 11:47:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:58,798 INFO L225 Difference]: With dead ends: 324 [2023-11-26 11:47:58,798 INFO L226 Difference]: Without dead ends: 215 [2023-11-26 11:47:58,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-11-26 11:47:58,800 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 234 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:58,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 474 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:47:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-26 11:47:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2023-11-26 11:47:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.183673469387755) internal successors, (174), 148 states have internal predecessors, (174), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:47:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2023-11-26 11:47:58,832 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 78 [2023-11-26 11:47:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:58,833 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-11-26 11:47:58,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:47:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2023-11-26 11:47:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-26 11:47:58,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:58,836 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:58,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:47:58,836 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:58,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1336800117, now seen corresponding path program 1 times [2023-11-26 11:47:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:58,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614965045] [2023-11-26 11:47:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614965045] [2023-11-26 11:47:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614965045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:59,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980431266] [2023-11-26 11:47:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:59,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:59,052 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:59,312 INFO L93 Difference]: Finished difference Result 426 states and 518 transitions. [2023-11-26 11:47:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:59,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-11-26 11:47:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:59,317 INFO L225 Difference]: With dead ends: 426 [2023-11-26 11:47:59,317 INFO L226 Difference]: Without dead ends: 262 [2023-11-26 11:47:59,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:47:59,319 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 139 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:59,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 206 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:47:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-26 11:47:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 175. [2023-11-26 11:47:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 157 states have (on average 1.1719745222929936) internal successors, (184), 158 states have internal predecessors, (184), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:47:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 208 transitions. [2023-11-26 11:47:59,346 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 208 transitions. Word has length 78 [2023-11-26 11:47:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:59,347 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 208 transitions. [2023-11-26 11:47:59,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 208 transitions. [2023-11-26 11:47:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-26 11:47:59,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:59,349 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:59,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:47:59,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:59,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2053877471, now seen corresponding path program 1 times [2023-11-26 11:47:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:59,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988805945] [2023-11-26 11:47:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:59,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:47:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:47:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:47:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:47:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:47:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:47:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:47:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:47:59,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988805945] [2023-11-26 11:47:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988805945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411119908] [2023-11-26 11:47:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:59,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:59,477 INFO L87 Difference]: Start difference. First operand 175 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:59,789 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2023-11-26 11:47:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-11-26 11:47:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:59,792 INFO L225 Difference]: With dead ends: 407 [2023-11-26 11:47:59,793 INFO L226 Difference]: Without dead ends: 233 [2023-11-26 11:47:59,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:59,795 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:59,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 353 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-26 11:47:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 168. [2023-11-26 11:47:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.1666666666666667) internal successors, (175), 151 states have internal predecessors, (175), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:47:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2023-11-26 11:47:59,823 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 78 [2023-11-26 11:47:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:59,824 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2023-11-26 11:47:59,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:47:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2023-11-26 11:47:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-26 11:47:59,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:59,827 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:59,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:47:59,827 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:59,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash -27641350, now seen corresponding path program 1 times [2023-11-26 11:47:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256513444] [2023-11-26 11:47:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256513444] [2023-11-26 11:48:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256513444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:01,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:01,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:48:01,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985694040] [2023-11-26 11:48:01,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:01,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:48:01,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:01,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:48:01,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:01,091 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:01,547 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2023-11-26 11:48:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:48:01,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-26 11:48:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:01,555 INFO L225 Difference]: With dead ends: 212 [2023-11-26 11:48:01,555 INFO L226 Difference]: Without dead ends: 210 [2023-11-26 11:48:01,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:01,558 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 56 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:01,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 234 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:48:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-26 11:48:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2023-11-26 11:48:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 176 states have internal predecessors, (199), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:48:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2023-11-26 11:48:01,617 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 80 [2023-11-26 11:48:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:01,620 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2023-11-26 11:48:01,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2023-11-26 11:48:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-26 11:48:01,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:01,623 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:01,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 11:48:01,624 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:01,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -27581768, now seen corresponding path program 1 times [2023-11-26 11:48:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150854063] [2023-11-26 11:48:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:01,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150854063] [2023-11-26 11:48:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150854063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:01,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:48:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289518892] [2023-11-26 11:48:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:01,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:48:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:48:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:01,977 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:02,210 INFO L93 Difference]: Finished difference Result 379 states and 444 transitions. [2023-11-26 11:48:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:48:02,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-26 11:48:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:02,213 INFO L225 Difference]: With dead ends: 379 [2023-11-26 11:48:02,214 INFO L226 Difference]: Without dead ends: 208 [2023-11-26 11:48:02,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:02,215 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:02,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:48:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-26 11:48:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2023-11-26 11:48:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 177 states have (on average 1.1299435028248588) internal successors, (200), 179 states have internal predecessors, (200), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:48:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2023-11-26 11:48:02,269 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 80 [2023-11-26 11:48:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:02,269 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2023-11-26 11:48:02,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2023-11-26 11:48:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-26 11:48:02,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:02,272 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:02,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 11:48:02,272 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:02,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 29676534, now seen corresponding path program 1 times [2023-11-26 11:48:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:02,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569039976] [2023-11-26 11:48:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:03,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569039976] [2023-11-26 11:48:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569039976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:48:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364502434] [2023-11-26 11:48:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:03,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:48:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:48:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:48:03,757 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 11:48:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:04,542 INFO L93 Difference]: Finished difference Result 522 states and 602 transitions. [2023-11-26 11:48:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:48:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2023-11-26 11:48:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:04,546 INFO L225 Difference]: With dead ends: 522 [2023-11-26 11:48:04,546 INFO L226 Difference]: Without dead ends: 347 [2023-11-26 11:48:04,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:48:04,548 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 152 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:04,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 334 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-26 11:48:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2023-11-26 11:48:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 272 states have (on average 1.1286764705882353) internal successors, (307), 274 states have internal predecessors, (307), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:48:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 347 transitions. [2023-11-26 11:48:04,607 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 347 transitions. Word has length 80 [2023-11-26 11:48:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:04,608 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 347 transitions. [2023-11-26 11:48:04,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 11:48:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 347 transitions. [2023-11-26 11:48:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-26 11:48:04,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:04,611 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:04,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 11:48:04,612 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:04,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 987999217, now seen corresponding path program 1 times [2023-11-26 11:48:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:04,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821801446] [2023-11-26 11:48:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821801446] [2023-11-26 11:48:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821801446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:05,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:05,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:48:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333946965] [2023-11-26 11:48:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:05,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:48:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:48:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:05,265 INFO L87 Difference]: Start difference. First operand 303 states and 347 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:48:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:05,681 INFO L93 Difference]: Finished difference Result 698 states and 796 transitions. [2023-11-26 11:48:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:48:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2023-11-26 11:48:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:05,687 INFO L225 Difference]: With dead ends: 698 [2023-11-26 11:48:05,687 INFO L226 Difference]: Without dead ends: 428 [2023-11-26 11:48:05,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:48:05,689 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 57 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:05,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 256 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:48:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-26 11:48:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 392. [2023-11-26 11:48:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 361 states have (on average 1.1246537396121883) internal successors, (406), 363 states have internal predecessors, (406), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:48:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 446 transitions. [2023-11-26 11:48:05,754 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 446 transitions. Word has length 82 [2023-11-26 11:48:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:05,755 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 446 transitions. [2023-11-26 11:48:05,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 11:48:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 446 transitions. [2023-11-26 11:48:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-26 11:48:05,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:05,757 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:05,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 11:48:05,758 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:05,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -406960800, now seen corresponding path program 1 times [2023-11-26 11:48:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:05,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439224033] [2023-11-26 11:48:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:05,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439224033] [2023-11-26 11:48:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439224033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:05,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:48:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276346622] [2023-11-26 11:48:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:05,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:05,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:05,908 INFO L87 Difference]: Start difference. First operand 392 states and 446 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:06,082 INFO L93 Difference]: Finished difference Result 661 states and 752 transitions. [2023-11-26 11:48:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-11-26 11:48:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:06,087 INFO L225 Difference]: With dead ends: 661 [2023-11-26 11:48:06,088 INFO L226 Difference]: Without dead ends: 302 [2023-11-26 11:48:06,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:06,090 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:06,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 171 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-26 11:48:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2023-11-26 11:48:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 271 states have (on average 1.1143911439114391) internal successors, (302), 273 states have internal predecessors, (302), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:48:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 342 transitions. [2023-11-26 11:48:06,146 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 342 transitions. Word has length 82 [2023-11-26 11:48:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:06,147 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 342 transitions. [2023-11-26 11:48:06,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 342 transitions. [2023-11-26 11:48:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-26 11:48:06,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:06,149 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:06,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 11:48:06,149 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:06,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash -720758835, now seen corresponding path program 1 times [2023-11-26 11:48:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776588885] [2023-11-26 11:48:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:07,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:07,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776588885] [2023-11-26 11:48:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776588885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:48:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991814782] [2023-11-26 11:48:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:07,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:48:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:48:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:48:07,954 INFO L87 Difference]: Start difference. First operand 302 states and 342 transitions. Second operand has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 11:48:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:08,980 INFO L93 Difference]: Finished difference Result 593 states and 670 transitions. [2023-11-26 11:48:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:48:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2023-11-26 11:48:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:08,985 INFO L225 Difference]: With dead ends: 593 [2023-11-26 11:48:08,985 INFO L226 Difference]: Without dead ends: 324 [2023-11-26 11:48:08,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-11-26 11:48:08,987 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 159 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:08,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 346 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:48:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-11-26 11:48:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 304. [2023-11-26 11:48:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 273 states have (on average 1.1135531135531136) internal successors, (304), 275 states have internal predecessors, (304), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:48:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 344 transitions. [2023-11-26 11:48:09,050 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 344 transitions. Word has length 83 [2023-11-26 11:48:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:09,050 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 344 transitions. [2023-11-26 11:48:09,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 11:48:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 344 transitions. [2023-11-26 11:48:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-26 11:48:09,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:09,053 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:09,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-26 11:48:09,053 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:09,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash -925985177, now seen corresponding path program 1 times [2023-11-26 11:48:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193695883] [2023-11-26 11:48:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:48:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:48:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:48:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:48:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193695883] [2023-11-26 11:48:09,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193695883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:09,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:48:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611651723] [2023-11-26 11:48:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:09,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:48:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:48:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:09,228 INFO L87 Difference]: Start difference. First operand 304 states and 344 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:09,424 INFO L93 Difference]: Finished difference Result 565 states and 636 transitions. [2023-11-26 11:48:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:48:09,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2023-11-26 11:48:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:09,426 INFO L225 Difference]: With dead ends: 565 [2023-11-26 11:48:09,426 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:48:09,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:09,433 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:09,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 183 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:48:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:48:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:48:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:48:09,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2023-11-26 11:48:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:09,437 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:48:09,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-26 11:48:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:48:09,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:48:09,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:48:09,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-26 11:48:09,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.