./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:50:20,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:50:20,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:50:20,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:50:20,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:50:20,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:50:20,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:50:20,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:50:20,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:50:20,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:50:20,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:50:20,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:50:20,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:50:20,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:50:20,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:50:20,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:50:20,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:50:20,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:50:20,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:50:20,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:50:20,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:50:20,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:50:20,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:50:20,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:50:20,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:50:20,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:50:20,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:50:20,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:50:20,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:50:20,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:50:20,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:50:20,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:50:20,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:50:20,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:50:20,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:50:20,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:50:20,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:50:20,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:50:20,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:50:20,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:50:20,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:50:20,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:50:20,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:50:20,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:50:20,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:50:20,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:50:20,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:50:20,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:50:20,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:50:20,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:50:20,854 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:50:20,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:50:20,855 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:50:20,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:50:20,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:50:20,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:50:20,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:50:20,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:50:20,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:50:20,856 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:50:20,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:50:20,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:50:20,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:50:20,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:50:20,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:50:20,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:50:20,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:50:20,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:50:20,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:50:20,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:50:20,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:50:20,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:50:20,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:50:20,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:50:20,858 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:50:20,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:50:20,858 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:50:20,858 INFO L138 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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f [2022-12-13 21:50:21,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:50:21,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:50:21,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:50:21,047 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:50:21,048 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:50:21,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2022-12-13 21:50:23,587 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:50:23,762 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:50:23,762 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2022-12-13 21:50:23,771 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/data/cef434c78/0e4d4beae1104bf8941eb1ffa50fef25/FLAGde04c4257 [2022-12-13 21:50:23,781 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/data/cef434c78/0e4d4beae1104bf8941eb1ffa50fef25 [2022-12-13 21:50:23,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:50:23,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:50:23,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:50:23,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:50:23,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:50:23,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:50:23" (1/1) ... [2022-12-13 21:50:23,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbdecb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:23, skipping insertion in model container [2022-12-13 21:50:23,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:50:23" (1/1) ... [2022-12-13 21:50:23,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:50:23,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:50:23,954 WARN L237 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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2022-12-13 21:50:24,008 WARN L237 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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2022-12-13 21:50:24,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:50:24,077 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:50:24,086 WARN L237 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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2022-12-13 21:50:24,108 WARN L237 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_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2022-12-13 21:50:24,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:50:24,167 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:50:24,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24 WrapperNode [2022-12-13 21:50:24,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:50:24,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:50:24,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:50:24,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:50:24,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,228 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 730 [2022-12-13 21:50:24,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:50:24,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:50:24,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:50:24,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:50:24,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,271 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:50:24,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:50:24,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:50:24,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:50:24,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (1/1) ... [2022-12-13 21:50:24,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:50:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:50:24,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:50:24,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_073b4c0a-85ea-4b12-baa5-a18e1fe26e7b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:50:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:50:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 21:50:24,345 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 21:50:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 21:50:24,345 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 21:50:24,346 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 21:50:24,346 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 21:50:24,346 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 21:50:24,346 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 21:50:24,346 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 21:50:24,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 21:50:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 21:50:24,347 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 21:50:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 21:50:24,347 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 21:50:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 21:50:24,347 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 21:50:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 21:50:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 21:50:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 21:50:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 21:50:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 21:50:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 21:50:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:50:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 21:50:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 21:50:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 21:50:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 21:50:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:50:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:50:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 21:50:24,350 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 21:50:24,448 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:50:24,450 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:50:24,941 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-12-13 21:50:24,942 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-12-13 21:50:24,985 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:50:24,992 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:50:24,992 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-12-13 21:50:24,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:50:24 BoogieIcfgContainer [2022-12-13 21:50:24,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:50:24,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:50:24,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:50:24,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:50:24,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:50:23" (1/3) ... [2022-12-13 21:50:24,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426802a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:50:24, skipping insertion in model container [2022-12-13 21:50:24,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:50:24" (2/3) ... [2022-12-13 21:50:24,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426802a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:50:24, skipping insertion in model container [2022-12-13 21:50:24,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:50:24" (3/3) ... [2022-12-13 21:50:25,000 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c [2022-12-13 21:50:25,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:50:25,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 21:50:25,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:50:25,058 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=LoopsAndPotentialCycles, 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;@28a4ee7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:50:25,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 21:50:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 296 states have (on average 1.6047297297297298) internal successors, (475), 302 states have internal predecessors, (475), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 21:50:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 21:50:25,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:25,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:25,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:25,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1893731304, now seen corresponding path program 1 times [2022-12-13 21:50:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:25,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801628780] [2022-12-13 21:50:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:25,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:50:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 21:50:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 21:50:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:25,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801628780] [2022-12-13 21:50:25,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801628780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:25,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:25,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:50:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668239385] [2022-12-13 21:50:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:50:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:50:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:50:25,483 INFO L87 Difference]: Start difference. First operand has 349 states, 296 states have (on average 1.6047297297297298) internal successors, (475), 302 states have internal predecessors, (475), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:26,378 INFO L93 Difference]: Finished difference Result 827 states and 1293 transitions. [2022-12-13 21:50:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 21:50:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:26,394 INFO L225 Difference]: With dead ends: 827 [2022-12-13 21:50:26,394 INFO L226 Difference]: Without dead ends: 490 [2022-12-13 21:50:26,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:50:26,402 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 934 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:26,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1521 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:50:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-12-13 21:50:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 451. [2022-12-13 21:50:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 378 states have (on average 1.492063492063492) internal successors, (564), 384 states have internal predecessors, (564), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-12-13 21:50:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 665 transitions. [2022-12-13 21:50:26,494 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 665 transitions. Word has length 65 [2022-12-13 21:50:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:26,495 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 665 transitions. [2022-12-13 21:50:26,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 665 transitions. [2022-12-13 21:50:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 21:50:26,499 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:26,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:26,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:50:26,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -214842664, now seen corresponding path program 1 times [2022-12-13 21:50:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:26,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239833884] [2022-12-13 21:50:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:50:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 21:50:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 21:50:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239833884] [2022-12-13 21:50:26,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239833884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:26,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:26,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:50:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525905768] [2022-12-13 21:50:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:26,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:50:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:50:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:50:26,703 INFO L87 Difference]: Start difference. First operand 451 states and 665 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:27,584 INFO L93 Difference]: Finished difference Result 848 states and 1231 transitions. [2022-12-13 21:50:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 21:50:27,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 21:50:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:27,589 INFO L225 Difference]: With dead ends: 848 [2022-12-13 21:50:27,590 INFO L226 Difference]: Without dead ends: 639 [2022-12-13 21:50:27,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 21:50:27,592 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 1241 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:27,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1574 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:50:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-12-13 21:50:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 563. [2022-12-13 21:50:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 468 states have (on average 1.4743589743589745) internal successors, (690), 476 states have internal predecessors, (690), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-12-13 21:50:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 825 transitions. [2022-12-13 21:50:27,641 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 825 transitions. Word has length 65 [2022-12-13 21:50:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:27,641 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 825 transitions. [2022-12-13 21:50:27,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 825 transitions. [2022-12-13 21:50:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 21:50:27,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:27,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:27,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:50:27,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2051538522, now seen corresponding path program 1 times [2022-12-13 21:50:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:27,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304938634] [2022-12-13 21:50:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:50:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 21:50:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 21:50:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:27,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304938634] [2022-12-13 21:50:27,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304938634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:27,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:27,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:50:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795746802] [2022-12-13 21:50:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:27,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:50:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:50:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:50:27,767 INFO L87 Difference]: Start difference. First operand 563 states and 825 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 21:50:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:29,247 INFO L93 Difference]: Finished difference Result 2109 states and 3023 transitions. [2022-12-13 21:50:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 21:50:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-12-13 21:50:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:29,255 INFO L225 Difference]: With dead ends: 2109 [2022-12-13 21:50:29,255 INFO L226 Difference]: Without dead ends: 1776 [2022-12-13 21:50:29,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 21:50:29,257 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 2846 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:29,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 2186 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 21:50:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-12-13 21:50:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1616. [2022-12-13 21:50:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1316 states have (on average 1.3936170212765957) internal successors, (1834), 1339 states have internal predecessors, (1834), 172 states have call successors, (172), 111 states have call predecessors, (172), 126 states have return successors, (206), 168 states have call predecessors, (206), 170 states have call successors, (206) [2022-12-13 21:50:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2212 transitions. [2022-12-13 21:50:29,338 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2212 transitions. Word has length 65 [2022-12-13 21:50:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:29,338 INFO L495 AbstractCegarLoop]: Abstraction has 1616 states and 2212 transitions. [2022-12-13 21:50:29,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 21:50:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2212 transitions. [2022-12-13 21:50:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 21:50:29,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:29,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:29,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:50:29,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash 209581264, now seen corresponding path program 1 times [2022-12-13 21:50:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:29,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230917012] [2022-12-13 21:50:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:50:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 21:50:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:50:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:29,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:29,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230917012] [2022-12-13 21:50:29,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230917012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:29,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:29,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:50:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407581032] [2022-12-13 21:50:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:29,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:50:29,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:29,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:50:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:50:29,454 INFO L87 Difference]: Start difference. First operand 1616 states and 2212 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 21:50:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:31,072 INFO L93 Difference]: Finished difference Result 5140 states and 7094 transitions. [2022-12-13 21:50:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 21:50:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-12-13 21:50:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:31,080 INFO L225 Difference]: With dead ends: 5140 [2022-12-13 21:50:31,080 INFO L226 Difference]: Without dead ends: 2021 [2022-12-13 21:50:31,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 21:50:31,085 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 2889 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:31,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 2235 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 21:50:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-12-13 21:50:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1817. [2022-12-13 21:50:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1447 states have (on average 1.3503800967519004) internal successors, (1954), 1472 states have internal predecessors, (1954), 212 states have call successors, (212), 139 states have call predecessors, (212), 156 states have return successors, (250), 208 states have call predecessors, (250), 210 states have call successors, (250) [2022-12-13 21:50:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2416 transitions. [2022-12-13 21:50:31,167 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2416 transitions. Word has length 66 [2022-12-13 21:50:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:31,168 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2416 transitions. [2022-12-13 21:50:31,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 21:50:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2416 transitions. [2022-12-13 21:50:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 21:50:31,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:31,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:31,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:50:31,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash 149517079, now seen corresponding path program 1 times [2022-12-13 21:50:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:31,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442327877] [2022-12-13 21:50:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:31,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:50:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:50:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:50:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:50:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:50:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442327877] [2022-12-13 21:50:31,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442327877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:31,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:31,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:50:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455013640] [2022-12-13 21:50:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:31,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:50:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:50:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:50:31,305 INFO L87 Difference]: Start difference. First operand 1817 states and 2416 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:50:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:32,111 INFO L93 Difference]: Finished difference Result 3640 states and 4857 transitions. [2022-12-13 21:50:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:50:32,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-12-13 21:50:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:32,119 INFO L225 Difference]: With dead ends: 3640 [2022-12-13 21:50:32,119 INFO L226 Difference]: Without dead ends: 2059 [2022-12-13 21:50:32,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:50:32,123 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 424 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:32,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1973 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:50:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2022-12-13 21:50:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1877. [2022-12-13 21:50:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1495 states have (on average 1.3351170568561872) internal successors, (1996), 1520 states have internal predecessors, (1996), 212 states have call successors, (212), 139 states have call predecessors, (212), 168 states have return successors, (262), 220 states have call predecessors, (262), 210 states have call successors, (262) [2022-12-13 21:50:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2470 transitions. [2022-12-13 21:50:32,234 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2470 transitions. Word has length 91 [2022-12-13 21:50:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:32,234 INFO L495 AbstractCegarLoop]: Abstraction has 1877 states and 2470 transitions. [2022-12-13 21:50:32,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:50:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2470 transitions. [2022-12-13 21:50:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 21:50:32,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:32,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:32,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:50:32,236 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 593417753, now seen corresponding path program 1 times [2022-12-13 21:50:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:32,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506722364] [2022-12-13 21:50:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:50:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:50:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:50:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:50:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:50:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:32,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506722364] [2022-12-13 21:50:32,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506722364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:32,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:32,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:50:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703524220] [2022-12-13 21:50:32,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:32,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:50:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:50:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:50:32,378 INFO L87 Difference]: Start difference. First operand 1877 states and 2470 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:33,259 INFO L93 Difference]: Finished difference Result 3437 states and 4521 transitions. [2022-12-13 21:50:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 21:50:33,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-12-13 21:50:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:33,265 INFO L225 Difference]: With dead ends: 3437 [2022-12-13 21:50:33,265 INFO L226 Difference]: Without dead ends: 2029 [2022-12-13 21:50:33,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-12-13 21:50:33,268 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 995 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:33,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1555 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:50:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-12-13 21:50:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1661. [2022-12-13 21:50:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1331 states have (on average 1.3388429752066116) internal successors, (1782), 1351 states have internal predecessors, (1782), 184 states have call successors, (184), 120 states have call predecessors, (184), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-12-13 21:50:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2189 transitions. [2022-12-13 21:50:33,355 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2189 transitions. Word has length 91 [2022-12-13 21:50:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:33,355 INFO L495 AbstractCegarLoop]: Abstraction has 1661 states and 2189 transitions. [2022-12-13 21:50:33,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2189 transitions. [2022-12-13 21:50:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 21:50:33,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:33,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:33,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:50:33,357 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1762387497, now seen corresponding path program 1 times [2022-12-13 21:50:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:33,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086907136] [2022-12-13 21:50:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:50:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:50:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:50:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:50:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:50:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:33,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086907136] [2022-12-13 21:50:33,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086907136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:33,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:33,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118988250] [2022-12-13 21:50:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:33,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:33,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:33,464 INFO L87 Difference]: Start difference. First operand 1661 states and 2189 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:50:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:34,111 INFO L93 Difference]: Finished difference Result 4803 states and 6357 transitions. [2022-12-13 21:50:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:50:34,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-12-13 21:50:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:34,122 INFO L225 Difference]: With dead ends: 4803 [2022-12-13 21:50:34,123 INFO L226 Difference]: Without dead ends: 3379 [2022-12-13 21:50:34,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 21:50:34,125 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 919 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:34,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1351 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:50:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2022-12-13 21:50:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3085. [2022-12-13 21:50:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 2444 states have (on average 1.3019639934533551) internal successors, (3182), 2493 states have internal predecessors, (3182), 345 states have call successors, (345), 233 states have call predecessors, (345), 294 states have return successors, (497), 361 states have call predecessors, (497), 343 states have call successors, (497) [2022-12-13 21:50:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4024 transitions. [2022-12-13 21:50:34,299 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4024 transitions. Word has length 91 [2022-12-13 21:50:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:34,299 INFO L495 AbstractCegarLoop]: Abstraction has 3085 states and 4024 transitions. [2022-12-13 21:50:34,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:50:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4024 transitions. [2022-12-13 21:50:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 21:50:34,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:34,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:34,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:50:34,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1474741721, now seen corresponding path program 1 times [2022-12-13 21:50:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:34,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590696928] [2022-12-13 21:50:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:50:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:50:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:50:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:50:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:50:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:34,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590696928] [2022-12-13 21:50:34,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590696928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:34,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:34,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:50:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483910099] [2022-12-13 21:50:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:34,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:50:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:50:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:50:34,371 INFO L87 Difference]: Start difference. First operand 3085 states and 4024 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:34,782 INFO L93 Difference]: Finished difference Result 4656 states and 6024 transitions. [2022-12-13 21:50:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:50:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-12-13 21:50:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:34,788 INFO L225 Difference]: With dead ends: 4656 [2022-12-13 21:50:34,788 INFO L226 Difference]: Without dead ends: 1808 [2022-12-13 21:50:34,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:50:34,792 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 732 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:34,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 896 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:50:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-12-13 21:50:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1661. [2022-12-13 21:50:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1331 states have (on average 1.3110443275732533) internal successors, (1745), 1351 states have internal predecessors, (1745), 184 states have call successors, (184), 120 states have call predecessors, (184), 144 states have return successors, (223), 191 states have call predecessors, (223), 182 states have call successors, (223) [2022-12-13 21:50:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2152 transitions. [2022-12-13 21:50:34,897 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2152 transitions. Word has length 91 [2022-12-13 21:50:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:34,898 INFO L495 AbstractCegarLoop]: Abstraction has 1661 states and 2152 transitions. [2022-12-13 21:50:34,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:50:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2152 transitions. [2022-12-13 21:50:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 21:50:34,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:34,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:34,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:50:34,899 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:34,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:34,899 INFO L85 PathProgramCache]: Analyzing trace with hash 818403522, now seen corresponding path program 1 times [2022-12-13 21:50:34,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:34,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357819675] [2022-12-13 21:50:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:34,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:50:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 21:50:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:50:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:50:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:50:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:50:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:50:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 21:50:34,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:34,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357819675] [2022-12-13 21:50:34,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357819675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:34,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:34,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:50:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330342305] [2022-12-13 21:50:34,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:34,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:50:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:50:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:50:34,995 INFO L87 Difference]: Start difference. First operand 1661 states and 2152 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 21:50:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:36,020 INFO L93 Difference]: Finished difference Result 4597 states and 5956 transitions. [2022-12-13 21:50:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 21:50:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-12-13 21:50:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:36,030 INFO L225 Difference]: With dead ends: 4597 [2022-12-13 21:50:36,030 INFO L226 Difference]: Without dead ends: 3173 [2022-12-13 21:50:36,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-12-13 21:50:36,033 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 1623 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:36,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1608 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:50:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2022-12-13 21:50:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 3011. [2022-12-13 21:50:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3011 states, 2359 states have (on average 1.2577363289529462) internal successors, (2967), 2401 states have internal predecessors, (2967), 356 states have call successors, (356), 227 states have call predecessors, (356), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-12-13 21:50:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 3823 transitions. [2022-12-13 21:50:36,186 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 3823 transitions. Word has length 92 [2022-12-13 21:50:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:36,186 INFO L495 AbstractCegarLoop]: Abstraction has 3011 states and 3823 transitions. [2022-12-13 21:50:36,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 21:50:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3823 transitions. [2022-12-13 21:50:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:36,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:36,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:50:36,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 232043999, now seen corresponding path program 1 times [2022-12-13 21:50:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:36,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709600133] [2022-12-13 21:50:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:36,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:36,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709600133] [2022-12-13 21:50:36,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709600133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:36,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:36,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:50:36,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308488665] [2022-12-13 21:50:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:36,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:50:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:36,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:50:36,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:50:36,265 INFO L87 Difference]: Start difference. First operand 3011 states and 3823 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:37,457 INFO L93 Difference]: Finished difference Result 3305 states and 4289 transitions. [2022-12-13 21:50:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:50:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:37,464 INFO L225 Difference]: With dead ends: 3305 [2022-12-13 21:50:37,464 INFO L226 Difference]: Without dead ends: 3087 [2022-12-13 21:50:37,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:50:37,466 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 699 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:37,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 728 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 21:50:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2022-12-13 21:50:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3011. [2022-12-13 21:50:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3011 states, 2359 states have (on average 1.2573124205171682) internal successors, (2966), 2401 states have internal predecessors, (2966), 356 states have call successors, (356), 227 states have call predecessors, (356), 294 states have return successors, (500), 385 states have call predecessors, (500), 354 states have call successors, (500) [2022-12-13 21:50:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 3822 transitions. [2022-12-13 21:50:37,743 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 3822 transitions. Word has length 112 [2022-12-13 21:50:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:37,743 INFO L495 AbstractCegarLoop]: Abstraction has 3011 states and 3822 transitions. [2022-12-13 21:50:37,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3822 transitions. [2022-12-13 21:50:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:37,745 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:37,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:37,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:50:37,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1539186397, now seen corresponding path program 1 times [2022-12-13 21:50:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:37,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844434763] [2022-12-13 21:50:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844434763] [2022-12-13 21:50:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844434763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:37,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:37,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714055224] [2022-12-13 21:50:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:37,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:37,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:37,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:37,880 INFO L87 Difference]: Start difference. First operand 3011 states and 3822 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:39,698 INFO L93 Difference]: Finished difference Result 3608 states and 4778 transitions. [2022-12-13 21:50:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:39,706 INFO L225 Difference]: With dead ends: 3608 [2022-12-13 21:50:39,706 INFO L226 Difference]: Without dead ends: 3395 [2022-12-13 21:50:39,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:50:39,707 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 1069 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:39,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1766 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 21:50:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states. [2022-12-13 21:50:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3234. [2022-12-13 21:50:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 2557 states have (on average 1.281579976535002) internal successors, (3277), 2601 states have internal predecessors, (3277), 373 states have call successors, (373), 233 states have call predecessors, (373), 302 states have return successors, (524), 403 states have call predecessors, (524), 371 states have call successors, (524) [2022-12-13 21:50:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4174 transitions. [2022-12-13 21:50:40,032 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4174 transitions. Word has length 112 [2022-12-13 21:50:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:40,032 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 4174 transitions. [2022-12-13 21:50:40,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4174 transitions. [2022-12-13 21:50:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:40,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:40,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:40,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:50:40,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash -79788517, now seen corresponding path program 1 times [2022-12-13 21:50:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:40,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765764071] [2022-12-13 21:50:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:40,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:40,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765764071] [2022-12-13 21:50:40,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765764071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:40,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:40,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227326339] [2022-12-13 21:50:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:40,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:40,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:40,152 INFO L87 Difference]: Start difference. First operand 3234 states and 4174 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:42,138 INFO L93 Difference]: Finished difference Result 4367 states and 5970 transitions. [2022-12-13 21:50:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:42,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:42,148 INFO L225 Difference]: With dead ends: 4367 [2022-12-13 21:50:42,148 INFO L226 Difference]: Without dead ends: 3933 [2022-12-13 21:50:42,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:50:42,152 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1073 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:42,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1680 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 21:50:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2022-12-13 21:50:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3644. [2022-12-13 21:50:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 2923 states have (on average 1.3137187820732124) internal successors, (3840), 2969 states have internal predecessors, (3840), 403 states have call successors, (403), 245 states have call predecessors, (403), 316 states have return successors, (564), 435 states have call predecessors, (564), 401 states have call successors, (564) [2022-12-13 21:50:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 4807 transitions. [2022-12-13 21:50:42,526 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 4807 transitions. Word has length 112 [2022-12-13 21:50:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:42,526 INFO L495 AbstractCegarLoop]: Abstraction has 3644 states and 4807 transitions. [2022-12-13 21:50:42,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 4807 transitions. [2022-12-13 21:50:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:42,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:42,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:42,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:50:42,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash -963297507, now seen corresponding path program 1 times [2022-12-13 21:50:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446154652] [2022-12-13 21:50:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446154652] [2022-12-13 21:50:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446154652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:42,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:42,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307691038] [2022-12-13 21:50:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:42,674 INFO L87 Difference]: Start difference. First operand 3644 states and 4807 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:44,566 INFO L93 Difference]: Finished difference Result 5851 states and 8295 transitions. [2022-12-13 21:50:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:44,577 INFO L225 Difference]: With dead ends: 5851 [2022-12-13 21:50:44,577 INFO L226 Difference]: Without dead ends: 5007 [2022-12-13 21:50:44,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:50:44,580 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1073 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:44,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1680 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 21:50:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2022-12-13 21:50:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 4466. [2022-12-13 21:50:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 3657 states have (on average 1.3584905660377358) internal successors, (4968), 3707 states have internal predecessors, (4968), 463 states have call successors, (463), 269 states have call predecessors, (463), 344 states have return successors, (650), 499 states have call predecessors, (650), 461 states have call successors, (650) [2022-12-13 21:50:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 6081 transitions. [2022-12-13 21:50:44,954 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 6081 transitions. Word has length 112 [2022-12-13 21:50:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:44,955 INFO L495 AbstractCegarLoop]: Abstraction has 4466 states and 6081 transitions. [2022-12-13 21:50:44,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 6081 transitions. [2022-12-13 21:50:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:44,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:44,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:44,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:50:44,957 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -991797797, now seen corresponding path program 1 times [2022-12-13 21:50:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:44,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881159308] [2022-12-13 21:50:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:45,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881159308] [2022-12-13 21:50:45,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881159308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:45,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614000816] [2022-12-13 21:50:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:45,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:45,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:45,069 INFO L87 Difference]: Start difference. First operand 4466 states and 6081 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:47,101 INFO L93 Difference]: Finished difference Result 8817 states and 12959 transitions. [2022-12-13 21:50:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:47,116 INFO L225 Difference]: With dead ends: 8817 [2022-12-13 21:50:47,116 INFO L226 Difference]: Without dead ends: 7151 [2022-12-13 21:50:47,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:50:47,121 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1073 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:47,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1680 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 21:50:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2022-12-13 21:50:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 6116. [2022-12-13 21:50:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 5131 states have (on average 1.4094718378483726) internal successors, (7232), 5189 states have internal predecessors, (7232), 583 states have call successors, (583), 317 states have call predecessors, (583), 400 states have return successors, (840), 627 states have call predecessors, (840), 581 states have call successors, (840) [2022-12-13 21:50:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 8655 transitions. [2022-12-13 21:50:47,615 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 8655 transitions. Word has length 112 [2022-12-13 21:50:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:47,615 INFO L495 AbstractCegarLoop]: Abstraction has 6116 states and 8655 transitions. [2022-12-13 21:50:47,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 8655 transitions. [2022-12-13 21:50:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:47,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:47,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:47,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:50:47,620 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1362587485, now seen corresponding path program 1 times [2022-12-13 21:50:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261917570] [2022-12-13 21:50:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:47,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:47,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261917570] [2022-12-13 21:50:47,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261917570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:47,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:47,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:47,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174189533] [2022-12-13 21:50:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:47,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:47,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:47,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:47,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:47,737 INFO L87 Difference]: Start difference. First operand 6116 states and 8655 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:50,431 INFO L93 Difference]: Finished difference Result 14747 states and 22343 transitions. [2022-12-13 21:50:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:50,451 INFO L225 Difference]: With dead ends: 14747 [2022-12-13 21:50:50,451 INFO L226 Difference]: Without dead ends: 11431 [2022-12-13 21:50:50,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:50:50,458 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1073 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:50,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1680 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 21:50:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11431 states. [2022-12-13 21:50:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11431 to 9430. [2022-12-13 21:50:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9430 states, 8093 states have (on average 1.4555788953416533) internal successors, (11780), 8167 states have internal predecessors, (11780), 823 states have call successors, (823), 413 states have call predecessors, (823), 512 states have return successors, (1274), 883 states have call predecessors, (1274), 821 states have call successors, (1274) [2022-12-13 21:50:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9430 states to 9430 states and 13877 transitions. [2022-12-13 21:50:51,296 INFO L78 Accepts]: Start accepts. Automaton has 9430 states and 13877 transitions. Word has length 112 [2022-12-13 21:50:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:51,297 INFO L495 AbstractCegarLoop]: Abstraction has 9430 states and 13877 transitions. [2022-12-13 21:50:51,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9430 states and 13877 transitions. [2022-12-13 21:50:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:51,300 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:51,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:50:51,300 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1055316581, now seen corresponding path program 1 times [2022-12-13 21:50:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:51,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617248319] [2022-12-13 21:50:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617248319] [2022-12-13 21:50:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617248319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:51,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:51,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589800313] [2022-12-13 21:50:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:51,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:51,412 INFO L87 Difference]: Start difference. First operand 9430 states and 13877 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:50:54,795 INFO L93 Difference]: Finished difference Result 26605 states and 41299 transitions. [2022-12-13 21:50:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:50:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:50:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:50:54,860 INFO L225 Difference]: With dead ends: 26605 [2022-12-13 21:50:54,860 INFO L226 Difference]: Without dead ends: 19975 [2022-12-13 21:50:54,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:50:54,882 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1073 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:50:54,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1680 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 21:50:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2022-12-13 21:50:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 16088. [2022-12-13 21:50:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16088 states, 14047 states have (on average 1.4892859685342066) internal successors, (20920), 14153 states have internal predecessors, (20920), 1303 states have call successors, (1303), 605 states have call predecessors, (1303), 736 states have return successors, (2304), 1395 states have call predecessors, (2304), 1301 states have call successors, (2304) [2022-12-13 21:50:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16088 states to 16088 states and 24527 transitions. [2022-12-13 21:50:56,292 INFO L78 Accepts]: Start accepts. Automaton has 16088 states and 24527 transitions. Word has length 112 [2022-12-13 21:50:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:50:56,292 INFO L495 AbstractCegarLoop]: Abstraction has 16088 states and 24527 transitions. [2022-12-13 21:50:56,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:50:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 16088 states and 24527 transitions. [2022-12-13 21:50:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:50:56,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:50:56,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:50:56,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:50:56,298 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:50:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:50:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1826050147, now seen corresponding path program 1 times [2022-12-13 21:50:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:50:56,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270126869] [2022-12-13 21:50:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:50:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:50:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:50:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:50:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:50:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:50:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:50:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:50:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:50:56,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:50:56,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270126869] [2022-12-13 21:50:56,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270126869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:50:56,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:50:56,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:50:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61245329] [2022-12-13 21:50:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:50:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:50:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:50:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:50:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:50:56,398 INFO L87 Difference]: Start difference. First operand 16088 states and 24527 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:51:02,603 INFO L93 Difference]: Finished difference Result 56271 states and 88769 transitions. [2022-12-13 21:51:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:51:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:51:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:51:02,706 INFO L225 Difference]: With dead ends: 56271 [2022-12-13 21:51:02,706 INFO L226 Difference]: Without dead ends: 42983 [2022-12-13 21:51:02,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:51:02,741 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 1142 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:51:02,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1674 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 21:51:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42983 states. [2022-12-13 21:51:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42983 to 29274. [2022-12-13 21:51:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29274 states, 25889 states have (on average 1.5127660396307312) internal successors, (39164), 26059 states have internal predecessors, (39164), 2199 states have call successors, (2199), 989 states have call predecessors, (2199), 1184 states have return successors, (4786), 2355 states have call predecessors, (4786), 2197 states have call successors, (4786) [2022-12-13 21:51:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29274 states to 29274 states and 46149 transitions. [2022-12-13 21:51:05,600 INFO L78 Accepts]: Start accepts. Automaton has 29274 states and 46149 transitions. Word has length 112 [2022-12-13 21:51:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:51:05,601 INFO L495 AbstractCegarLoop]: Abstraction has 29274 states and 46149 transitions. [2022-12-13 21:51:05,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29274 states and 46149 transitions. [2022-12-13 21:51:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:51:05,611 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:51:05,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:51:05,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:51:05,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:51:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:51:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1474223451, now seen corresponding path program 1 times [2022-12-13 21:51:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:51:05,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870882417] [2022-12-13 21:51:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:51:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:51:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:51:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:05,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:51:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:51:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:05,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:51:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:05,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:51:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:51:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:51:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870882417] [2022-12-13 21:51:05,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870882417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:51:05,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:51:05,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:51:05,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142927466] [2022-12-13 21:51:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:51:05,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:51:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:51:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:51:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:51:05,719 INFO L87 Difference]: Start difference. First operand 29274 states and 46149 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:51:16,608 INFO L93 Difference]: Finished difference Result 105748 states and 170709 transitions. [2022-12-13 21:51:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:51:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:51:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:51:16,830 INFO L225 Difference]: With dead ends: 105748 [2022-12-13 21:51:16,830 INFO L226 Difference]: Without dead ends: 79274 [2022-12-13 21:51:16,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:51:16,899 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 1135 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:51:16,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 1674 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 21:51:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79274 states. [2022-12-13 21:51:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79274 to 55708. [2022-12-13 21:51:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55708 states, 49699 states have (on average 1.5285619428962354) internal successors, (75968), 49997 states have internal predecessors, (75968), 3927 states have call successors, (3927), 1757 states have call predecessors, (3927), 2080 states have return successors, (11144), 4211 states have call predecessors, (11144), 3925 states have call successors, (11144) [2022-12-13 21:51:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55708 states to 55708 states and 91039 transitions. [2022-12-13 21:51:22,626 INFO L78 Accepts]: Start accepts. Automaton has 55708 states and 91039 transitions. Word has length 112 [2022-12-13 21:51:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:51:22,626 INFO L495 AbstractCegarLoop]: Abstraction has 55708 states and 91039 transitions. [2022-12-13 21:51:22,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55708 states and 91039 transitions. [2022-12-13 21:51:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:51:22,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:51:22,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:51:22,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 21:51:22,647 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:51:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:51:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -484351335, now seen corresponding path program 1 times [2022-12-13 21:51:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:51:22,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934275341] [2022-12-13 21:51:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:51:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:51:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:51:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:51:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:22,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:51:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:51:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:51:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:51:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:51:22,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934275341] [2022-12-13 21:51:22,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934275341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:51:22,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:51:22,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:51:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091429821] [2022-12-13 21:51:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:51:22,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:51:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:51:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:51:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:51:22,747 INFO L87 Difference]: Start difference. First operand 55708 states and 91039 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:51:32,550 INFO L93 Difference]: Finished difference Result 123592 states and 208952 transitions. [2022-12-13 21:51:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:51:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:51:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:51:32,769 INFO L225 Difference]: With dead ends: 123592 [2022-12-13 21:51:32,769 INFO L226 Difference]: Without dead ends: 70682 [2022-12-13 21:51:32,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:51:32,874 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1036 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 21:51:32,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 865 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 21:51:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70682 states. [2022-12-13 21:51:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70682 to 55708. [2022-12-13 21:51:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55708 states, 49699 states have (on average 1.5233908126924083) internal successors, (75711), 49997 states have internal predecessors, (75711), 3927 states have call successors, (3927), 1757 states have call predecessors, (3927), 2080 states have return successors, (11144), 4211 states have call predecessors, (11144), 3925 states have call successors, (11144) [2022-12-13 21:51:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55708 states to 55708 states and 90782 transitions. [2022-12-13 21:51:38,608 INFO L78 Accepts]: Start accepts. Automaton has 55708 states and 90782 transitions. Word has length 112 [2022-12-13 21:51:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:51:38,608 INFO L495 AbstractCegarLoop]: Abstraction has 55708 states and 90782 transitions. [2022-12-13 21:51:38,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 55708 states and 90782 transitions. [2022-12-13 21:51:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:51:38,628 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:51:38,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:51:38,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 21:51:38,629 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:51:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:51:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1392131483, now seen corresponding path program 1 times [2022-12-13 21:51:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:51:38,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568108858] [2022-12-13 21:51:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:51:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:51:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:51:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:51:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:38,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:51:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:51:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:51:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:51:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:51:38,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568108858] [2022-12-13 21:51:38,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568108858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:51:38,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:51:38,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:51:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125464227] [2022-12-13 21:51:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:51:38,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:51:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:51:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:51:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:51:38,727 INFO L87 Difference]: Start difference. First operand 55708 states and 90782 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:51:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:51:58,185 INFO L93 Difference]: Finished difference Result 200154 states and 332279 transitions. [2022-12-13 21:51:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:51:58,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:51:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:51:58,709 INFO L225 Difference]: With dead ends: 200154 [2022-12-13 21:51:58,709 INFO L226 Difference]: Without dead ends: 147246 [2022-12-13 21:51:58,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:51:58,851 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 1187 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:51:58,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1674 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 21:51:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147246 states. [2022-12-13 21:52:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147246 to 108704. [2022-12-13 21:52:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108704 states, 97575 states have (on average 1.5316115808352548) internal successors, (149447), 98129 states have internal predecessors, (149447), 7255 states have call successors, (7255), 3293 states have call predecessors, (7255), 3872 states have return successors, (28106), 7795 states have call predecessors, (28106), 7253 states have call successors, (28106) [2022-12-13 21:52:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108704 states to 108704 states and 184808 transitions. [2022-12-13 21:52:11,093 INFO L78 Accepts]: Start accepts. Automaton has 108704 states and 184808 transitions. Word has length 112 [2022-12-13 21:52:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:52:11,093 INFO L495 AbstractCegarLoop]: Abstraction has 108704 states and 184808 transitions. [2022-12-13 21:52:11,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:52:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 108704 states and 184808 transitions. [2022-12-13 21:52:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:52:11,133 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:52:11,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:11,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 21:52:11,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:52:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash -486999463, now seen corresponding path program 1 times [2022-12-13 21:52:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:11,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621719995] [2022-12-13 21:52:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:52:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:52:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:11,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:52:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:11,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:52:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:52:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:52:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621719995] [2022-12-13 21:52:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621719995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:11,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:52:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552940609] [2022-12-13 21:52:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:11,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:52:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:52:11,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:52:11,232 INFO L87 Difference]: Start difference. First operand 108704 states and 184808 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:52:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:52:47,506 INFO L93 Difference]: Finished difference Result 388326 states and 672535 transitions. [2022-12-13 21:52:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:52:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:52:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:52:48,743 INFO L225 Difference]: With dead ends: 388326 [2022-12-13 21:52:48,743 INFO L226 Difference]: Without dead ends: 282422 [2022-12-13 21:52:49,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:52:49,013 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 1103 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:52:49,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1674 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 21:52:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282422 states. [2022-12-13 21:53:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282422 to 214440. [2022-12-13 21:53:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214440 states, 193327 states have (on average 1.537162424286313) internal successors, (297175), 194393 states have internal predecessors, (297175), 13655 states have call successors, (13655), 6365 states have call predecessors, (13655), 7456 states have return successors, (74896), 14707 states have call predecessors, (74896), 13653 states have call successors, (74896) [2022-12-13 21:53:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214440 states to 214440 states and 385726 transitions. [2022-12-13 21:53:13,860 INFO L78 Accepts]: Start accepts. Automaton has 214440 states and 385726 transitions. Word has length 112 [2022-12-13 21:53:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:53:13,860 INFO L495 AbstractCegarLoop]: Abstraction has 214440 states and 385726 transitions. [2022-12-13 21:53:13,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:53:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 214440 states and 385726 transitions. [2022-12-13 21:53:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:53:13,948 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:53:13,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:13,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 21:53:13,948 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:53:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash 837856731, now seen corresponding path program 1 times [2022-12-13 21:53:13,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:53:13,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216579810] [2022-12-13 21:53:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:53:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:13,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:53:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:53:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:53:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:53:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:53:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:53:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:53:14,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216579810] [2022-12-13 21:53:14,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216579810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:14,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:14,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:53:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797992139] [2022-12-13 21:53:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:14,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:53:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:14,044 INFO L87 Difference]: Start difference. First operand 214440 states and 385726 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:54:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:54:23,859 INFO L93 Difference]: Finished difference Result 755198 states and 1390431 transitions. [2022-12-13 21:54:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:54:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:54:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:54:26,621 INFO L225 Difference]: With dead ends: 755198 [2022-12-13 21:54:26,622 INFO L226 Difference]: Without dead ends: 543558 [2022-12-13 21:54:27,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:54:27,250 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 1108 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:54:27,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1674 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 21:54:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543558 states. [2022-12-13 21:55:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543558 to 425400. [2022-12-13 21:55:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425400 states, 384831 states have (on average 1.5413077428793418) internal successors, (593143), 386921 states have internal predecessors, (593143), 25943 states have call successors, (25943), 12509 states have call predecessors, (25943), 14624 states have return successors, (207330), 28019 states have call predecessors, (207330), 25941 states have call successors, (207330) [2022-12-13 21:55:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425400 states to 425400 states and 826416 transitions. [2022-12-13 21:55:20,179 INFO L78 Accepts]: Start accepts. Automaton has 425400 states and 826416 transitions. Word has length 112 [2022-12-13 21:55:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:55:20,180 INFO L495 AbstractCegarLoop]: Abstraction has 425400 states and 826416 transitions. [2022-12-13 21:55:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:55:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 425400 states and 826416 transitions. [2022-12-13 21:55:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:55:20,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:55:20,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:55:20,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 21:55:20,433 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:55:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:55:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1890352615, now seen corresponding path program 1 times [2022-12-13 21:55:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:55:20,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923096947] [2022-12-13 21:55:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:55:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:55:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:55:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:55:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:55:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:55:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:55:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:55:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:55:20,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923096947] [2022-12-13 21:55:20,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923096947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:55:20,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:55:20,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:55:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915840783] [2022-12-13 21:55:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:55:20,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:55:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:55:20,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:55:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:55:20,554 INFO L87 Difference]: Start difference. First operand 425400 states and 826416 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:57:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:57:42,687 INFO L93 Difference]: Finished difference Result 1196542 states and 2165950 transitions. [2022-12-13 21:57:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:57:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-12-13 21:57:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:57:46,248 INFO L225 Difference]: With dead ends: 1196542 [2022-12-13 21:57:46,248 INFO L226 Difference]: Without dead ends: 773942 [2022-12-13 21:57:48,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:57:48,035 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 759 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:57:48,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1415 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 21:57:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773942 states. [2022-12-13 21:58:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773942 to 431544. [2022-12-13 21:58:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431544 states, 390975 states have (on average 1.5328013300083125) internal successors, (599287), 393065 states have internal predecessors, (599287), 25943 states have call successors, (25943), 12509 states have call predecessors, (25943), 14624 states have return successors, (207330), 28019 states have call predecessors, (207330), 25941 states have call successors, (207330) [2022-12-13 21:58:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431544 states to 431544 states and 832560 transitions. [2022-12-13 21:58:45,502 INFO L78 Accepts]: Start accepts. Automaton has 431544 states and 832560 transitions. Word has length 112 [2022-12-13 21:58:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:58:45,503 INFO L495 AbstractCegarLoop]: Abstraction has 431544 states and 832560 transitions. [2022-12-13 21:58:45,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:58:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 431544 states and 832560 transitions. [2022-12-13 21:58:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:58:45,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:58:45,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:58:45,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 21:58:45,883 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:58:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:58:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 493572123, now seen corresponding path program 1 times [2022-12-13 21:58:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:58:45,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591980819] [2022-12-13 21:58:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:58:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:58:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:58:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:58:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:58:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:58:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:58:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:58:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:58:46,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591980819] [2022-12-13 21:58:46,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591980819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:58:46,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:58:46,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:58:46,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480206075] [2022-12-13 21:58:46,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:58:46,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:58:46,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:58:46,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:58:46,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:58:46,033 INFO L87 Difference]: Start difference. First operand 431544 states and 832560 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)