./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/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_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/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_79aa1882-8cd6-4981-af73-d6c3871c1f01/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 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:49:49,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:49:49,554 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:49:49,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:49:49,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:49:49,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:49:49,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:49:49,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:49:49,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:49:49,618 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:49:49,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:49:49,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:49:49,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:49:49,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:49:49,623 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:49:49,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:49:49,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:49:49,625 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:49:49,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:49:49,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:49:49,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:49:49,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:49:49,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:49:49,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:49:49,628 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:49:49,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:49:49,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:49:49,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:49:49,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:49:49,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:49:49,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:49:49,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:49,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:49:49,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:49:49,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:49:49,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:49:49,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:49:49,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:49:49,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:49:49,635 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:49:49,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:49:49,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:49:49,636 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_79aa1882-8cd6-4981-af73-d6c3871c1f01/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_79aa1882-8cd6-4981-af73-d6c3871c1f01/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 -> 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 [2023-11-26 10:49:49,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:49:49,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:49:49,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:49:49,977 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:49:49,978 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:49:49,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2023-11-26 10:49:53,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:49:53,357 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:49:53,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2023-11-26 10:49:53,372 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/data/ca3bfbfa3/8bc0d195b5da4e10b3c73deaa05f8ac7/FLAG08dced386 [2023-11-26 10:49:53,398 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/data/ca3bfbfa3/8bc0d195b5da4e10b3c73deaa05f8ac7 [2023-11-26 10:49:53,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:49:53,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:49:53,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:53,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:49:53,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:49:53,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12201478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53, skipping insertion in model container [2023-11-26 10:49:53,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:49:53,610 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_79aa1882-8cd6-4981-af73-d6c3871c1f01/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i[916,929] [2023-11-26 10:49:53,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:53,688 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:49:53,713 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_79aa1882-8cd6-4981-af73-d6c3871c1f01/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i[916,929] [2023-11-26 10:49:53,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:53,782 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:49:53,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53 WrapperNode [2023-11-26 10:49:53,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:53,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:53,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:49:53,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:49:53,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,885 INFO L138 Inliner]: procedures = 26, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2023-11-26 10:49:53,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:53,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:49:53,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:49:53,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:49:53,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,943 INFO L175 MemorySlicer]: Split 138 memory accesses to 15 slices as follows [2, 11, 6, 22, 22, 22, 6, 8, 5, 3, 8, 7, 3, 6, 7]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2023-11-26 10:49:53,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:49:53,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:49:53,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:49:53,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:49:53,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (1/1) ... [2023-11-26 10:49:53,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:54,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:54,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:49:54,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79aa1882-8cd6-4981-af73-d6c3871c1f01/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:49:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:49:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:49:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:49:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:49:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:49:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 10:49:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-26 10:49:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-26 10:49:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-26 10:49:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-26 10:49:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-26 10:49:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-26 10:49:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-26 10:49:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-26 10:49:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-26 10:49:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-26 10:49:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:49:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:49:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 10:49:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 10:49:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 10:49:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-26 10:49:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-26 10:49:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-26 10:49:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-26 10:49:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-26 10:49:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-26 10:49:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-26 10:49:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-26 10:49:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-26 10:49:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-26 10:49:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:49:54,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:49:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:49:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:49:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:49:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:49:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 10:49:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-26 10:49:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-26 10:49:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-26 10:49:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-26 10:49:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-26 10:49:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-26 10:49:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-26 10:49:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-26 10:49:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-26 10:49:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-26 10:49:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:49:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:49:54,364 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:49:54,367 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:49:54,990 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:49:55,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:49:55,039 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:49:55,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:55 BoogieIcfgContainer [2023-11-26 10:49:55,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:49:55,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:49:55,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:49:55,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:49:55,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:49:53" (1/3) ... [2023-11-26 10:49:55,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca74112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:55, skipping insertion in model container [2023-11-26 10:49:55,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:53" (2/3) ... [2023-11-26 10:49:55,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca74112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:55, skipping insertion in model container [2023-11-26 10:49:55,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:55" (3/3) ... [2023-11-26 10:49:55,050 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-71.i [2023-11-26 10:49:55,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:49:55,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:49:55,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:55,132 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;@473b1fa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:55,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:49:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 10:49:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 10:49:55,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:55,155 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:55,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:55,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash 206066625, now seen corresponding path program 1 times [2023-11-26 10:49:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333843179] [2023-11-26 10:49:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:49:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:49:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:49:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:49:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:49:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:49:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:49:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:49:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:49:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:49:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:49:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:49:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:49:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:49:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:49:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:49:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:49:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:49:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333843179] [2023-11-26 10:49:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333843179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:55,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:55,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67500506] [2023-11-26 10:49:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:55,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:49:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:49:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:49:55,880 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 10:49:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:55,936 INFO L93 Difference]: Finished difference Result 193 states and 309 transitions. [2023-11-26 10:49:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:49:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2023-11-26 10:49:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:55,948 INFO L225 Difference]: With dead ends: 193 [2023-11-26 10:49:55,948 INFO L226 Difference]: Without dead ends: 96 [2023-11-26 10:49:55,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 10:49:55,956 INFO L413 NwaCegarLoop]: 135 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, 135 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 10:49:55,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:49:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-26 10:49:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-26 10:49:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 10:49:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2023-11-26 10:49:56,010 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 139 [2023-11-26 10:49:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:56,010 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2023-11-26 10:49:56,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-26 10:49:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2023-11-26 10:49:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 10:49:56,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:56,016 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:56,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:49:56,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:56,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2021636071, now seen corresponding path program 1 times [2023-11-26 10:49:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481714079] [2023-11-26 10:49:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:49:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:49:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:49:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:49:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:49:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:49:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:49:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:49:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:49:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:49:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:49:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:49:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:49:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:49:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:49:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:49:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:49:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:49:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481714079] [2023-11-26 10:49:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481714079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515063672] [2023-11-26 10:49:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:56,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:56,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:56,544 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:56,613 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-11-26 10:49:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:49:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-26 10:49:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:56,617 INFO L225 Difference]: With dead ends: 199 [2023-11-26 10:49:56,618 INFO L226 Difference]: Without dead ends: 104 [2023-11-26 10:49:56,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 10:49:56,620 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 393 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 10:49:56,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:49:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-26 10:49:56,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-11-26 10:49:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 10:49:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2023-11-26 10:49:56,638 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 139 [2023-11-26 10:49:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:56,640 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2023-11-26 10:49:56,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2023-11-26 10:49:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 10:49:56,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:56,644 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:49:56,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:56,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2078894373, now seen corresponding path program 1 times [2023-11-26 10:49:56,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:56,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975392243] [2023-11-26 10:49:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:49:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:49:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:49:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:49:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:49:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:49:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:49:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:49:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:49:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:49:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:49:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:49:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:49:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:49:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:49:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:49:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:49:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:49:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975392243] [2023-11-26 10:49:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975392243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:57,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864988733] [2023-11-26 10:49:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:57,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:57,017 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:57,071 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2023-11-26 10:49:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:49:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-26 10:49:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:57,074 INFO L225 Difference]: With dead ends: 199 [2023-11-26 10:49:57,074 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 10:49:57,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 10:49:57,077 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 394 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 10:49:57,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 394 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:49:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 10:49:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-11-26 10:49:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-26 10:49:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-11-26 10:49:57,092 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 139 [2023-11-26 10:49:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:57,093 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-11-26 10:49:57,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-11-26 10:49:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 10:49:57,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:57,097 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:57,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:49:57,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:57,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2078953955, now seen corresponding path program 1 times [2023-11-26 10:49:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177051889] [2023-11-26 10:49:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:49:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:49:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:49:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:49:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:49:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:49:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:49:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:49:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:49:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:49:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:49:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:49:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:49:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:49:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:49:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:49:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:49:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:49:57,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177051889] [2023-11-26 10:49:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177051889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:49:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447869709] [2023-11-26 10:49:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:57,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:49:57,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:57,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:49:57,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:49:57,660 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:57,888 INFO L93 Difference]: Finished difference Result 271 states and 385 transitions. [2023-11-26 10:49:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:49:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-26 10:49:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:57,895 INFO L225 Difference]: With dead ends: 271 [2023-11-26 10:49:57,896 INFO L226 Difference]: Without dead ends: 172 [2023-11-26 10:49:57,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:57,898 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 124 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:57,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 622 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-26 10:49:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2023-11-26 10:49:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 138 states have internal predecessors, (182), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-26 10:49:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2023-11-26 10:49:57,944 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 139 [2023-11-26 10:49:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:57,948 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2023-11-26 10:49:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2023-11-26 10:49:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-26 10:49:57,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:57,955 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:57,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:49:57,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:57,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1846418358, now seen corresponding path program 1 times [2023-11-26 10:49:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138721264] [2023-11-26 10:49:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:49:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:49:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:49:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:49:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:49:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:49:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:49:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:49:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:49:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:49:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:49:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:49:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:49:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:49:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:49:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:49:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:49:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:49:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138721264] [2023-11-26 10:49:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138721264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:58,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:58,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:49:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016117049] [2023-11-26 10:49:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:58,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:49:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:58,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:58,901 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:59,269 INFO L93 Difference]: Finished difference Result 496 states and 697 transitions. [2023-11-26 10:49:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:49:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2023-11-26 10:49:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:59,275 INFO L225 Difference]: With dead ends: 496 [2023-11-26 10:49:59,276 INFO L226 Difference]: Without dead ends: 328 [2023-11-26 10:49:59,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:49:59,283 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 236 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:59,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 761 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-26 10:49:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 256. [2023-11-26 10:49:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 206 states have (on average 1.3106796116504855) internal successors, (270), 209 states have internal predecessors, (270), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-26 10:49:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2023-11-26 10:49:59,347 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 140 [2023-11-26 10:49:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:59,348 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2023-11-26 10:49:59,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:49:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2023-11-26 10:49:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-26 10:49:59,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:59,352 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:59,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:49:59,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:59,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1611679062, now seen corresponding path program 1 times [2023-11-26 10:49:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425198069] [2023-11-26 10:49:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:00,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425198069] [2023-11-26 10:50:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425198069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111833834] [2023-11-26 10:50:00,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:00,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:00,297 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:00,644 INFO L93 Difference]: Finished difference Result 520 states and 727 transitions. [2023-11-26 10:50:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:50:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2023-11-26 10:50:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:00,648 INFO L225 Difference]: With dead ends: 520 [2023-11-26 10:50:00,648 INFO L226 Difference]: Without dead ends: 285 [2023-11-26 10:50:00,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:00,652 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 214 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:00,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 870 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:50:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-26 10:50:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2023-11-26 10:50:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 212 states have (on average 1.3018867924528301) internal successors, (276), 215 states have internal predecessors, (276), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-26 10:50:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2023-11-26 10:50:00,692 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 141 [2023-11-26 10:50:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:00,693 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2023-11-26 10:50:00,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2023-11-26 10:50:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-26 10:50:00,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:00,697 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:00,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:50:00,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:00,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1929151229, now seen corresponding path program 1 times [2023-11-26 10:50:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949703287] [2023-11-26 10:50:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:01,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949703287] [2023-11-26 10:50:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949703287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:01,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068904963] [2023-11-26 10:50:01,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:01,134 INFO L87 Difference]: Start difference. First operand 263 states and 366 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:01,219 INFO L93 Difference]: Finished difference Result 517 states and 717 transitions. [2023-11-26 10:50:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2023-11-26 10:50:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:01,224 INFO L225 Difference]: With dead ends: 517 [2023-11-26 10:50:01,224 INFO L226 Difference]: Without dead ends: 275 [2023-11-26 10:50:01,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 10:50:01,229 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 98 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:01,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 558 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-26 10:50:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 251. [2023-11-26 10:50:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 200 states have (on average 1.28) internal successors, (256), 203 states have internal predecessors, (256), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-26 10:50:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 346 transitions. [2023-11-26 10:50:01,264 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 346 transitions. Word has length 141 [2023-11-26 10:50:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:01,265 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 346 transitions. [2023-11-26 10:50:01,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 346 transitions. [2023-11-26 10:50:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 10:50:01,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:01,268 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:01,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:50:01,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:01,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1117388278, now seen corresponding path program 1 times [2023-11-26 10:50:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196332890] [2023-11-26 10:50:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:01,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196332890] [2023-11-26 10:50:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196332890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715475209] [2023-11-26 10:50:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:01,660 INFO L87 Difference]: Start difference. First operand 251 states and 346 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:01,749 INFO L93 Difference]: Finished difference Result 477 states and 656 transitions. [2023-11-26 10:50:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:50:01,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2023-11-26 10:50:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:01,752 INFO L225 Difference]: With dead ends: 477 [2023-11-26 10:50:01,752 INFO L226 Difference]: Without dead ends: 247 [2023-11-26 10:50:01,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 10:50:01,755 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:01,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 593 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-26 10:50:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2023-11-26 10:50:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.268041237113402) internal successors, (246), 197 states have internal predecessors, (246), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-26 10:50:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2023-11-26 10:50:01,790 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 142 [2023-11-26 10:50:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:01,790 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2023-11-26 10:50:01,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2023-11-26 10:50:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 10:50:01,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:01,793 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:01,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:50:01,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:01,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash -53240966, now seen corresponding path program 1 times [2023-11-26 10:50:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677943828] [2023-11-26 10:50:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677943828] [2023-11-26 10:50:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677943828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:03,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-26 10:50:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774782520] [2023-11-26 10:50:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:03,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-26 10:50:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:03,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 10:50:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-26 10:50:03,551 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-26 10:50:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:04,808 INFO L93 Difference]: Finished difference Result 572 states and 778 transitions. [2023-11-26 10:50:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:50:04,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 142 [2023-11-26 10:50:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:04,816 INFO L225 Difference]: With dead ends: 572 [2023-11-26 10:50:04,816 INFO L226 Difference]: Without dead ends: 348 [2023-11-26 10:50:04,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2023-11-26 10:50:04,820 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 458 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:04,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 660 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 10:50:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-26 10:50:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 296. [2023-11-26 10:50:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 241 states have (on average 1.2738589211618256) internal successors, (307), 245 states have internal predecessors, (307), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-26 10:50:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 401 transitions. [2023-11-26 10:50:04,887 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 401 transitions. Word has length 142 [2023-11-26 10:50:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:04,888 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 401 transitions. [2023-11-26 10:50:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-26 10:50:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 401 transitions. [2023-11-26 10:50:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 10:50:04,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:04,890 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:04,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:50:04,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:04,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash 957876284, now seen corresponding path program 1 times [2023-11-26 10:50:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107060787] [2023-11-26 10:50:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107060787] [2023-11-26 10:50:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107060787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:05,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526854480] [2023-11-26 10:50:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:05,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:05,605 INFO L87 Difference]: Start difference. First operand 296 states and 401 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:05,869 INFO L93 Difference]: Finished difference Result 578 states and 782 transitions. [2023-11-26 10:50:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:50:05,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2023-11-26 10:50:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:05,872 INFO L225 Difference]: With dead ends: 578 [2023-11-26 10:50:05,873 INFO L226 Difference]: Without dead ends: 307 [2023-11-26 10:50:05,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:05,874 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 134 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:05,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 871 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-26 10:50:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2023-11-26 10:50:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 246 states have (on average 1.2642276422764227) internal successors, (311), 250 states have internal predecessors, (311), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2023-11-26 10:50:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 409 transitions. [2023-11-26 10:50:05,921 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 409 transitions. Word has length 142 [2023-11-26 10:50:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:05,921 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 409 transitions. [2023-11-26 10:50:05,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 409 transitions. [2023-11-26 10:50:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 10:50:05,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:05,924 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:05,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:50:05,924 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:05,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -187254472, now seen corresponding path program 1 times [2023-11-26 10:50:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:05,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409100002] [2023-11-26 10:50:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:06,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409100002] [2023-11-26 10:50:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409100002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:06,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:06,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802209264] [2023-11-26 10:50:06,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:06,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:06,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:06,479 INFO L87 Difference]: Start difference. First operand 304 states and 409 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:06,727 INFO L93 Difference]: Finished difference Result 657 states and 887 transitions. [2023-11-26 10:50:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:50:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2023-11-26 10:50:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:06,731 INFO L225 Difference]: With dead ends: 657 [2023-11-26 10:50:06,731 INFO L226 Difference]: Without dead ends: 378 [2023-11-26 10:50:06,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:50:06,733 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 202 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:06,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1255 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-11-26 10:50:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 346. [2023-11-26 10:50:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.2398523985239853) internal successors, (336), 275 states have internal predecessors, (336), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-26 10:50:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 464 transitions. [2023-11-26 10:50:06,793 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 464 transitions. Word has length 142 [2023-11-26 10:50:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:06,794 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 464 transitions. [2023-11-26 10:50:06,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 464 transitions. [2023-11-26 10:50:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-26 10:50:06,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:06,798 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:06,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:50:06,798 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:06,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash 823862778, now seen corresponding path program 1 times [2023-11-26 10:50:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:06,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728897521] [2023-11-26 10:50:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728897521] [2023-11-26 10:50:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728897521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 10:50:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048346814] [2023-11-26 10:50:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:07,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:50:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:50:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:50:07,943 INFO L87 Difference]: Start difference. First operand 346 states and 464 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 10:50:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:08,767 INFO L93 Difference]: Finished difference Result 669 states and 896 transitions. [2023-11-26 10:50:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:50:08,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 142 [2023-11-26 10:50:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:08,771 INFO L225 Difference]: With dead ends: 669 [2023-11-26 10:50:08,771 INFO L226 Difference]: Without dead ends: 348 [2023-11-26 10:50:08,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:08,773 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 226 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:08,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 577 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:50:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-26 10:50:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2023-11-26 10:50:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 270 states have (on average 1.2333333333333334) internal successors, (333), 274 states have internal predecessors, (333), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-26 10:50:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 461 transitions. [2023-11-26 10:50:08,841 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 461 transitions. Word has length 142 [2023-11-26 10:50:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:08,841 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 461 transitions. [2023-11-26 10:50:08,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 10:50:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 461 transitions. [2023-11-26 10:50:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-26 10:50:08,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:08,844 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:08,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:50:08,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:08,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 682123567, now seen corresponding path program 1 times [2023-11-26 10:50:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353897155] [2023-11-26 10:50:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353897155] [2023-11-26 10:50:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353897155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 10:50:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074362025] [2023-11-26 10:50:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:09,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:50:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:50:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:50:09,836 INFO L87 Difference]: Start difference. First operand 346 states and 461 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:10,593 INFO L93 Difference]: Finished difference Result 750 states and 1002 transitions. [2023-11-26 10:50:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 10:50:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-26 10:50:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:10,597 INFO L225 Difference]: With dead ends: 750 [2023-11-26 10:50:10,598 INFO L226 Difference]: Without dead ends: 429 [2023-11-26 10:50:10,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-26 10:50:10,600 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 180 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:10,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1239 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:50:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-11-26 10:50:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 406. [2023-11-26 10:50:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.2445820433436532) internal successors, (402), 328 states have internal predecessors, (402), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-26 10:50:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 542 transitions. [2023-11-26 10:50:10,675 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 542 transitions. Word has length 143 [2023-11-26 10:50:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:10,676 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 542 transitions. [2023-11-26 10:50:10,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 542 transitions. [2023-11-26 10:50:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-26 10:50:10,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:10,679 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:10,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:50:10,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:10,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1042183336, now seen corresponding path program 1 times [2023-11-26 10:50:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:10,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960927463] [2023-11-26 10:50:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:10,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:10,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960927463] [2023-11-26 10:50:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960927463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:11,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581606896] [2023-11-26 10:50:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:11,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:11,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:11,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:11,031 INFO L87 Difference]: Start difference. First operand 406 states and 542 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:11,247 INFO L93 Difference]: Finished difference Result 874 states and 1169 transitions. [2023-11-26 10:50:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:50:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-26 10:50:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:11,252 INFO L225 Difference]: With dead ends: 874 [2023-11-26 10:50:11,252 INFO L226 Difference]: Without dead ends: 493 [2023-11-26 10:50:11,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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 10:50:11,255 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 141 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:11,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 550 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-26 10:50:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 406. [2023-11-26 10:50:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.241486068111455) internal successors, (401), 328 states have internal predecessors, (401), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-26 10:50:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 541 transitions. [2023-11-26 10:50:11,337 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 541 transitions. Word has length 143 [2023-11-26 10:50:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:11,337 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 541 transitions. [2023-11-26 10:50:11,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 541 transitions. [2023-11-26 10:50:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-26 10:50:11,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:11,340 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:11,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:50:11,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:11,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1019825518, now seen corresponding path program 1 times [2023-11-26 10:50:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557948164] [2023-11-26 10:50:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557948164] [2023-11-26 10:50:11,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557948164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:11,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237827710] [2023-11-26 10:50:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:11,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:11,774 INFO L87 Difference]: Start difference. First operand 406 states and 541 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:11,997 INFO L93 Difference]: Finished difference Result 810 states and 1079 transitions. [2023-11-26 10:50:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:11,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-26 10:50:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:12,001 INFO L225 Difference]: With dead ends: 810 [2023-11-26 10:50:12,001 INFO L226 Difference]: Without dead ends: 429 [2023-11-26 10:50:12,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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 10:50:12,005 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 136 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:12,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 535 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-11-26 10:50:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 406. [2023-11-26 10:50:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.238390092879257) internal successors, (400), 328 states have internal predecessors, (400), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-26 10:50:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 540 transitions. [2023-11-26 10:50:12,083 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 540 transitions. Word has length 143 [2023-11-26 10:50:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:12,084 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 540 transitions. [2023-11-26 10:50:12,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 540 transitions. [2023-11-26 10:50:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-26 10:50:12,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:12,088 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:12,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:50:12,088 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:12,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1242836, now seen corresponding path program 1 times [2023-11-26 10:50:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442412811] [2023-11-26 10:50:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442412811] [2023-11-26 10:50:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442412811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572017771] [2023-11-26 10:50:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:12,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:12,484 INFO L87 Difference]: Start difference. First operand 406 states and 540 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:12,740 INFO L93 Difference]: Finished difference Result 788 states and 1046 transitions. [2023-11-26 10:50:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:50:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-26 10:50:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:12,745 INFO L225 Difference]: With dead ends: 788 [2023-11-26 10:50:12,746 INFO L226 Difference]: Without dead ends: 407 [2023-11-26 10:50:12,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 10:50:12,751 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 87 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:12,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 648 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-26 10:50:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2023-11-26 10:50:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 320 states have (on average 1.23125) internal successors, (394), 325 states have internal predecessors, (394), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-26 10:50:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 534 transitions. [2023-11-26 10:50:12,869 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 534 transitions. Word has length 143 [2023-11-26 10:50:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:12,870 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 534 transitions. [2023-11-26 10:50:12,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 534 transitions. [2023-11-26 10:50:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-26 10:50:12,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:12,875 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:12,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:50:12,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:12,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1305691030, now seen corresponding path program 1 times [2023-11-26 10:50:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706728461] [2023-11-26 10:50:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:14,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706728461] [2023-11-26 10:50:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706728461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 10:50:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915770254] [2023-11-26 10:50:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:14,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:50:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:50:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:50:14,138 INFO L87 Difference]: Start difference. First operand 404 states and 534 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:14,975 INFO L93 Difference]: Finished difference Result 1257 states and 1665 transitions. [2023-11-26 10:50:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 10:50:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2023-11-26 10:50:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:14,982 INFO L225 Difference]: With dead ends: 1257 [2023-11-26 10:50:14,982 INFO L226 Difference]: Without dead ends: 878 [2023-11-26 10:50:14,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:50:14,985 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 249 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:14,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 959 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:50:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2023-11-26 10:50:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 535. [2023-11-26 10:50:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 445 states have (on average 1.256179775280899) internal successors, (559), 452 states have internal predecessors, (559), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-26 10:50:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 707 transitions. [2023-11-26 10:50:15,094 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 707 transitions. Word has length 144 [2023-11-26 10:50:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:15,095 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 707 transitions. [2023-11-26 10:50:15,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-26 10:50:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 707 transitions. [2023-11-26 10:50:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-26 10:50:15,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:15,098 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:15,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:50:15,099 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:15,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 276880682, now seen corresponding path program 1 times [2023-11-26 10:50:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571543582] [2023-11-26 10:50:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571543582] [2023-11-26 10:50:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571543582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:17,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-26 10:50:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734700343] [2023-11-26 10:50:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:17,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-26 10:50:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 10:50:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-26 10:50:17,385 INFO L87 Difference]: Start difference. First operand 535 states and 707 transitions. Second operand has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-26 10:50:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:18,852 INFO L93 Difference]: Finished difference Result 1343 states and 1775 transitions. [2023-11-26 10:50:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:50:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 145 [2023-11-26 10:50:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:18,859 INFO L225 Difference]: With dead ends: 1343 [2023-11-26 10:50:18,859 INFO L226 Difference]: Without dead ends: 833 [2023-11-26 10:50:18,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2023-11-26 10:50:18,862 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 712 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:18,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 671 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 10:50:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-11-26 10:50:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 571. [2023-11-26 10:50:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 481 states have (on average 1.2661122661122661) internal successors, (609), 488 states have internal predecessors, (609), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-26 10:50:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 757 transitions. [2023-11-26 10:50:18,949 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 757 transitions. Word has length 145 [2023-11-26 10:50:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:18,949 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 757 transitions. [2023-11-26 10:50:18,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-26 10:50:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 757 transitions. [2023-11-26 10:50:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-26 10:50:18,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:18,952 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:18,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:50:18,953 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:18,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1311467220, now seen corresponding path program 1 times [2023-11-26 10:50:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096684765] [2023-11-26 10:50:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096684765] [2023-11-26 10:50:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096684765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-26 10:50:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079245083] [2023-11-26 10:50:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:20,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 10:50:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 10:50:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:50:20,695 INFO L87 Difference]: Start difference. First operand 571 states and 757 transitions. Second operand has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-26 10:50:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:22,663 INFO L93 Difference]: Finished difference Result 1389 states and 1835 transitions. [2023-11-26 10:50:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:50:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 145 [2023-11-26 10:50:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:22,671 INFO L225 Difference]: With dead ends: 1389 [2023-11-26 10:50:22,671 INFO L226 Difference]: Without dead ends: 843 [2023-11-26 10:50:22,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2023-11-26 10:50:22,674 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 622 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:22,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 806 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-26 10:50:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2023-11-26 10:50:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 593. [2023-11-26 10:50:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 503 states have (on average 1.268389662027833) internal successors, (638), 510 states have internal predecessors, (638), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-26 10:50:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 786 transitions. [2023-11-26 10:50:22,784 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 786 transitions. Word has length 145 [2023-11-26 10:50:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:22,784 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 786 transitions. [2023-11-26 10:50:22,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-26 10:50:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 786 transitions. [2023-11-26 10:50:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-26 10:50:22,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:22,788 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:22,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:50:22,788 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:22,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash 98888182, now seen corresponding path program 1 times [2023-11-26 10:50:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:22,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594796017] [2023-11-26 10:50:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:23,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:23,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594796017] [2023-11-26 10:50:23,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594796017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:23,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 10:50:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728638817] [2023-11-26 10:50:23,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:23,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:50:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:50:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:50:23,688 INFO L87 Difference]: Start difference. First operand 593 states and 786 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 10:50:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:24,538 INFO L93 Difference]: Finished difference Result 1241 states and 1641 transitions. [2023-11-26 10:50:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:50:24,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 145 [2023-11-26 10:50:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:24,543 INFO L225 Difference]: With dead ends: 1241 [2023-11-26 10:50:24,543 INFO L226 Difference]: Without dead ends: 673 [2023-11-26 10:50:24,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-26 10:50:24,545 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 232 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:24,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 683 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 10:50:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2023-11-26 10:50:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 593. [2023-11-26 10:50:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 503 states have (on average 1.2664015904572565) internal successors, (637), 510 states have internal predecessors, (637), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-26 10:50:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 785 transitions. [2023-11-26 10:50:24,625 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 785 transitions. Word has length 145 [2023-11-26 10:50:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:24,625 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 785 transitions. [2023-11-26 10:50:24,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 10:50:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 785 transitions. [2023-11-26 10:50:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-26 10:50:24,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:24,629 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:24,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:50:24,629 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:24,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash -41660428, now seen corresponding path program 1 times [2023-11-26 10:50:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:24,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869722327] [2023-11-26 10:50:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:24,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869722327] [2023-11-26 10:50:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869722327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:25,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-26 10:50:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403330083] [2023-11-26 10:50:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:25,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-26 10:50:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:25,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 10:50:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-26 10:50:25,611 INFO L87 Difference]: Start difference. First operand 593 states and 785 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 10:50:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:27,616 INFO L93 Difference]: Finished difference Result 1385 states and 1831 transitions. [2023-11-26 10:50:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 10:50:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 145 [2023-11-26 10:50:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:27,623 INFO L225 Difference]: With dead ends: 1385 [2023-11-26 10:50:27,623 INFO L226 Difference]: Without dead ends: 817 [2023-11-26 10:50:27,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2023-11-26 10:50:27,626 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 439 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:27,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1284 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-26 10:50:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2023-11-26 10:50:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 605. [2023-11-26 10:50:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 515 states have (on average 1.2640776699029126) internal successors, (651), 522 states have internal predecessors, (651), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-26 10:50:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 799 transitions. [2023-11-26 10:50:27,717 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 799 transitions. Word has length 145 [2023-11-26 10:50:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:27,718 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 799 transitions. [2023-11-26 10:50:27,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-26 10:50:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 799 transitions. [2023-11-26 10:50:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-26 10:50:27,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:27,721 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:27,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 10:50:27,722 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:27,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1730604170, now seen corresponding path program 1 times [2023-11-26 10:50:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343507608] [2023-11-26 10:50:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 10:50:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 10:50:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 10:50:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:50:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 10:50:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:50:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 10:50:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-26 10:50:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343507608] [2023-11-26 10:50:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343507608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:29,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-26 10:50:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140141980] [2023-11-26 10:50:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:29,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-26 10:50:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-26 10:50:29,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:29,661 INFO L87 Difference]: Start difference. First operand 605 states and 799 transitions. Second operand has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 17 states have internal predecessors, (53), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-26 10:50:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:32,327 INFO L93 Difference]: Finished difference Result 1407 states and 1855 transitions. [2023-11-26 10:50:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 10:50:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 17 states have internal predecessors, (53), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 145 [2023-11-26 10:50:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:32,337 INFO L225 Difference]: With dead ends: 1407 [2023-11-26 10:50:32,337 INFO L226 Difference]: Without dead ends: 827 [2023-11-26 10:50:32,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2023-11-26 10:50:32,342 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 325 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:32,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1488 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-26 10:50:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2023-11-26 10:50:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 603. [2023-11-26 10:50:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 513 states have (on average 1.2612085769980508) internal successors, (647), 520 states have internal predecessors, (647), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-26 10:50:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 795 transitions. [2023-11-26 10:50:32,439 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 795 transitions. Word has length 145 [2023-11-26 10:50:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:32,439 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 795 transitions. [2023-11-26 10:50:32,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 17 states have internal predecessors, (53), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-26 10:50:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 795 transitions. [2023-11-26 10:50:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-26 10:50:32,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:32,443 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:32,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 10:50:32,443 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:32,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -232592408, now seen corresponding path program 1 times [2023-11-26 10:50:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704482574] [2023-11-26 10:50:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:50:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 10:50:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 10:50:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:50:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:50:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:50:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 10:50:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 10:50:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:50:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat