./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN --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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- 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-6b4ec56 [2022-11-20 10:39:09,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:39:09,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:39:09,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:39:09,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:39:09,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:39:09,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:39:09,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:39:09,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:39:09,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:39:09,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:39:09,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:39:09,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:39:09,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:39:09,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:39:09,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:39:09,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:39:09,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:39:09,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:39:09,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:39:09,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:39:09,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:39:09,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:39:09,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:39:09,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:39:09,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:39:09,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:39:09,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:39:09,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:39:09,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:39:09,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:39:09,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:39:09,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:39:09,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:39:09,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:39:09,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:39:09,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:39:09,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:39:09,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:39:09,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:39:09,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:39:09,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:39:09,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:39:09,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:39:09,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:39:09,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:39:09,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:39:09,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:39:09,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:39:09,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:39:09,919 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:39:09,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:39:09,920 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:39:09,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:39:09,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:39:09,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:39:09,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:39:09,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:39:09,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:39:09,922 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:39:09,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:39:09,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:39:09,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:39:09,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:39:09,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:39:09,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:39:09,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:39:09,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:39:09,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:39:09,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:39:09,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:39:09,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:39:09,926 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:39:09,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:39:09,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:39:09,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2022-11-20 10:39:10,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:39:10,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:39:10,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:39:10,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:39:10,252 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:39:10,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-11-20 10:39:13,668 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:39:13,952 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:39:13,953 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-11-20 10:39:13,965 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/data/71e33946d/d84ce79747464556a8b1785ba27d440f/FLAG9d29c2b6a [2022-11-20 10:39:13,986 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/data/71e33946d/d84ce79747464556a8b1785ba27d440f [2022-11-20 10:39:13,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:39:13,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:39:14,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:39:14,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:39:14,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:39:14,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:39:13" (1/1) ... [2022-11-20 10:39:14,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c64e406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14, skipping insertion in model container [2022-11-20 10:39:14,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:39:13" (1/1) ... [2022-11-20 10:39:14,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:39:14,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:39:14,257 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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-11-20 10:39:14,338 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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-11-20 10:39:14,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:39:14,403 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:39:14,418 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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-11-20 10:39:14,466 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_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-11-20 10:39:14,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:39:14,513 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:39:14,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14 WrapperNode [2022-11-20 10:39:14,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:39:14,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:39:14,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:39:14,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:39:14,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,577 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2022-11-20 10:39:14,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:39:14,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:39:14,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:39:14,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:39:14,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,636 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:39:14,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:39:14,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:39:14,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:39:14,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (1/1) ... [2022-11-20 10:39:14,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:39:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:14,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:39:14,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:39:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:39:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-20 10:39:14,764 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-20 10:39:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-20 10:39:14,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-20 10:39:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-20 10:39:14,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-20 10:39:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-20 10:39:14,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-20 10:39:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-20 10:39:14,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-20 10:39:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-20 10:39:14,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-20 10:39:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-20 10:39:14,766 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-20 10:39:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-20 10:39:14,766 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-20 10:39:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-20 10:39:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-20 10:39:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-20 10:39:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-20 10:39:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-20 10:39:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-20 10:39:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:39:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-20 10:39:14,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-20 10:39:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-20 10:39:14,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-20 10:39:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:39:14,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:39:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-20 10:39:14,769 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-20 10:39:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-20 10:39:14,769 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-20 10:39:14,898 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:39:14,901 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:39:15,636 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:39:15,646 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:39:15,646 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-20 10:39:15,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:39:15 BoogieIcfgContainer [2022-11-20 10:39:15,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:39:15,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:39:15,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:39:15,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:39:15,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:39:13" (1/3) ... [2022-11-20 10:39:15,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dee1159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:39:15, skipping insertion in model container [2022-11-20 10:39:15,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:14" (2/3) ... [2022-11-20 10:39:15,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dee1159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:39:15, skipping insertion in model container [2022-11-20 10:39:15,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:39:15" (3/3) ... [2022-11-20 10:39:15,661 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-11-20 10:39:15,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:39:15,685 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 10:39:15,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:39:15,772 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;@654481f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:39:15,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 10:39:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-20 10:39:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:39:15,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:15,793 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] [2022-11-20 10:39:15,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2022-11-20 10:39:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:15,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086436051] [2022-11-20 10:39:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:39:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:39:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:39:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:39:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:16,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086436051] [2022-11-20 10:39:16,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086436051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:16,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:16,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:39:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947675517] [2022-11-20 10:39:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:16,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:39:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:39:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:39:16,387 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:17,704 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2022-11-20 10:39:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:39:17,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-20 10:39:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:17,720 INFO L225 Difference]: With dead ends: 552 [2022-11-20 10:39:17,721 INFO L226 Difference]: Without dead ends: 343 [2022-11-20 10:39:17,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:39:17,729 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 546 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:17,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 690 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:39:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-20 10:39:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2022-11-20 10:39:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-11-20 10:39:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2022-11-20 10:39:17,815 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2022-11-20 10:39:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:17,816 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2022-11-20 10:39:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2022-11-20 10:39:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:39:17,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:17,819 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] [2022-11-20 10:39:17,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:39:17,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:17,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2022-11-20 10:39:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:17,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112020295] [2022-11-20 10:39:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:39:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:39:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:39:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:39:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:18,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112020295] [2022-11-20 10:39:18,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112020295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:18,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:18,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017264243] [2022-11-20 10:39:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:18,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:18,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:18,151 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:19,294 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2022-11-20 10:39:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:39:19,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-20 10:39:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:19,299 INFO L225 Difference]: With dead ends: 651 [2022-11-20 10:39:19,300 INFO L226 Difference]: Without dead ends: 456 [2022-11-20 10:39:19,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:39:19,303 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 540 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:19,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 811 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:39:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-20 10:39:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2022-11-20 10:39:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-20 10:39:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2022-11-20 10:39:19,356 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2022-11-20 10:39:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:19,356 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2022-11-20 10:39:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2022-11-20 10:39:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:39:19,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:19,359 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] [2022-11-20 10:39:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:39:19,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2022-11-20 10:39:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:19,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921157702] [2022-11-20 10:39:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:39:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:39:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:39:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:39:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921157702] [2022-11-20 10:39:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921157702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808008299] [2022-11-20 10:39:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:19,529 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:20,627 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2022-11-20 10:39:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:39:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-20 10:39:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:20,633 INFO L225 Difference]: With dead ends: 1002 [2022-11-20 10:39:20,634 INFO L226 Difference]: Without dead ends: 717 [2022-11-20 10:39:20,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:39:20,637 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 549 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:20,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1002 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:39:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-11-20 10:39:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2022-11-20 10:39:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-11-20 10:39:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2022-11-20 10:39:20,715 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2022-11-20 10:39:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:20,715 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2022-11-20 10:39:20,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2022-11-20 10:39:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:39:20,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:20,727 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] [2022-11-20 10:39:20,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:39:20,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2022-11-20 10:39:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:20,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228958855] [2022-11-20 10:39:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:20,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:39:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:20,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:39:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:20,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:39:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:39:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228958855] [2022-11-20 10:39:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228958855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:20,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:20,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300255156] [2022-11-20 10:39:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:20,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:20,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:20,953 INFO L87 Difference]: Start difference. First operand 565 states and 804 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:21,900 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2022-11-20 10:39:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:39:21,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-20 10:39:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:21,909 INFO L225 Difference]: With dead ends: 1182 [2022-11-20 10:39:21,910 INFO L226 Difference]: Without dead ends: 723 [2022-11-20 10:39:21,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:39:21,916 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 278 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:21,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 896 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:39:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-20 10:39:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2022-11-20 10:39:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-11-20 10:39:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2022-11-20 10:39:21,991 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2022-11-20 10:39:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:21,991 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2022-11-20 10:39:21,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2022-11-20 10:39:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:39:21,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:21,995 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] [2022-11-20 10:39:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:39:21,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2022-11-20 10:39:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:21,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272042573] [2022-11-20 10:39:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:39:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:39:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:39:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:39:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:22,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:22,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272042573] [2022-11-20 10:39:22,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272042573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:22,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:22,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425798073] [2022-11-20 10:39:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:22,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:22,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:22,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:22,219 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:23,910 INFO L93 Difference]: Finished difference Result 2468 states and 3598 transitions. [2022-11-20 10:39:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:39:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-20 10:39:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:23,924 INFO L225 Difference]: With dead ends: 2468 [2022-11-20 10:39:23,924 INFO L226 Difference]: Without dead ends: 1994 [2022-11-20 10:39:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:39:23,929 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 1090 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:23,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 846 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 10:39:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-11-20 10:39:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1739. [2022-11-20 10:39:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-11-20 10:39:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2431 transitions. [2022-11-20 10:39:24,138 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2431 transitions. Word has length 58 [2022-11-20 10:39:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:24,140 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2431 transitions. [2022-11-20 10:39:24,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:39:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2431 transitions. [2022-11-20 10:39:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:24,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:24,143 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-11-20 10:39:24,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:39:24,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2022-11-20 10:39:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:24,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032672457] [2022-11-20 10:39:24,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:24,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032672457] [2022-11-20 10:39:24,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032672457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:24,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:24,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:39:24,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753908229] [2022-11-20 10:39:24,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:24,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:39:24,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:24,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:39:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:24,319 INFO L87 Difference]: Start difference. First operand 1739 states and 2431 transitions. 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-11-20 10:39:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:25,441 INFO L93 Difference]: Finished difference Result 1962 states and 2746 transitions. [2022-11-20 10:39:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:39:25,441 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-11-20 10:39:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:25,453 INFO L225 Difference]: With dead ends: 1962 [2022-11-20 10:39:25,456 INFO L226 Difference]: Without dead ends: 1874 [2022-11-20 10:39:25,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:39:25,463 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 556 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:25,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 727 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:39:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-11-20 10:39:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1835. [2022-11-20 10:39:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-11-20 10:39:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2563 transitions. [2022-11-20 10:39:25,718 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2563 transitions. Word has length 65 [2022-11-20 10:39:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:25,725 INFO L495 AbstractCegarLoop]: Abstraction has 1835 states and 2563 transitions. [2022-11-20 10:39:25,725 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-11-20 10:39:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2563 transitions. [2022-11-20 10:39:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:25,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:25,729 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-11-20 10:39:25,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:39:25,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2022-11-20 10:39:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:25,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989568942] [2022-11-20 10:39:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:25,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989568942] [2022-11-20 10:39:25,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989568942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:25,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:25,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:39:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092266391] [2022-11-20 10:39:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:25,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:39:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:39:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:25,940 INFO L87 Difference]: Start difference. First operand 1835 states and 2563 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-11-20 10:39:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:27,132 INFO L93 Difference]: Finished difference Result 2182 states and 3040 transitions. [2022-11-20 10:39:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:39:27,133 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-11-20 10:39:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:27,147 INFO L225 Difference]: With dead ends: 2182 [2022-11-20 10:39:27,147 INFO L226 Difference]: Without dead ends: 2005 [2022-11-20 10:39:27,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:39:27,151 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 712 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:27,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 978 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:39:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-11-20 10:39:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1931. [2022-11-20 10:39:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-11-20 10:39:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2697 transitions. [2022-11-20 10:39:27,432 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2697 transitions. Word has length 65 [2022-11-20 10:39:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:27,433 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 2697 transitions. [2022-11-20 10:39:27,433 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-11-20 10:39:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2697 transitions. [2022-11-20 10:39:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:27,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:27,436 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-11-20 10:39:27,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:39:27,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2022-11-20 10:39:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:27,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243798808] [2022-11-20 10:39:27,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:27,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:27,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:27,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243798808] [2022-11-20 10:39:27,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243798808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:27,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:27,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:39:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530168300] [2022-11-20 10:39:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:27,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:39:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:39:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:39:27,702 INFO L87 Difference]: Start difference. First operand 1931 states and 2697 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 10:39:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:28,767 INFO L93 Difference]: Finished difference Result 2232 states and 3111 transitions. [2022-11-20 10:39:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:39:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-11-20 10:39:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:28,778 INFO L225 Difference]: With dead ends: 2232 [2022-11-20 10:39:28,778 INFO L226 Difference]: Without dead ends: 1965 [2022-11-20 10:39:28,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:39:28,784 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 218 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:28,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1190 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:39:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2022-11-20 10:39:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1936. [2022-11-20 10:39:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-11-20 10:39:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2700 transitions. [2022-11-20 10:39:29,084 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2700 transitions. Word has length 65 [2022-11-20 10:39:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:29,087 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 2700 transitions. [2022-11-20 10:39:29,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 10:39:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2700 transitions. [2022-11-20 10:39:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:29,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:29,090 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-11-20 10:39:29,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:39:29,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:29,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2022-11-20 10:39:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:29,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256965752] [2022-11-20 10:39:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:29,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256965752] [2022-11-20 10:39:29,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256965752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:29,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:29,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:39:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126767674] [2022-11-20 10:39:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:39:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:39:29,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:39:29,340 INFO L87 Difference]: Start difference. First operand 1936 states and 2700 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:39:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:31,985 INFO L93 Difference]: Finished difference Result 3598 states and 4972 transitions. [2022-11-20 10:39:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 10:39:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-20 10:39:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:32,005 INFO L225 Difference]: With dead ends: 3598 [2022-11-20 10:39:32,005 INFO L226 Difference]: Without dead ends: 3326 [2022-11-20 10:39:32,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 10:39:32,009 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 1595 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:32,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 1157 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 10:39:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-11-20 10:39:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3076. [2022-11-20 10:39:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-11-20 10:39:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4184 transitions. [2022-11-20 10:39:32,469 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4184 transitions. Word has length 65 [2022-11-20 10:39:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:32,469 INFO L495 AbstractCegarLoop]: Abstraction has 3076 states and 4184 transitions. [2022-11-20 10:39:32,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:39:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4184 transitions. [2022-11-20 10:39:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:32,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:32,474 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-11-20 10:39:32,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:39:32,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2022-11-20 10:39:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:32,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763114679] [2022-11-20 10:39:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:32,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763114679] [2022-11-20 10:39:32,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763114679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:32,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:32,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:39:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091308064] [2022-11-20 10:39:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:39:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:39:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:39:32,655 INFO L87 Difference]: Start difference. First operand 3076 states and 4184 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 10:39:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:33,957 INFO L93 Difference]: Finished difference Result 4677 states and 6308 transitions. [2022-11-20 10:39:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:39:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-11-20 10:39:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:33,977 INFO L225 Difference]: With dead ends: 4677 [2022-11-20 10:39:33,977 INFO L226 Difference]: Without dead ends: 3265 [2022-11-20 10:39:33,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:39:33,983 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 216 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:33,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1189 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:39:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2022-11-20 10:39:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3121. [2022-11-20 10:39:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2476 states have (on average 1.3477382875605817) internal successors, (3337), 2536 states have internal predecessors, (3337), 349 states have call successors, (349), 245 states have call predecessors, (349), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2022-11-20 10:39:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4223 transitions. [2022-11-20 10:39:34,436 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4223 transitions. Word has length 65 [2022-11-20 10:39:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:34,436 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4223 transitions. [2022-11-20 10:39:34,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 10:39:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4223 transitions. [2022-11-20 10:39:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:34,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:34,440 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-11-20 10:39:34,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:39:34,441 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2022-11-20 10:39:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385224362] [2022-11-20 10:39:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385224362] [2022-11-20 10:39:34,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385224362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:34,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:34,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:39:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976070443] [2022-11-20 10:39:34,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:34,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:39:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:39:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:34,637 INFO L87 Difference]: Start difference. First operand 3121 states and 4223 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-11-20 10:39:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:35,995 INFO L93 Difference]: Finished difference Result 4556 states and 6062 transitions. [2022-11-20 10:39:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:39:35,996 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-11-20 10:39:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:36,014 INFO L225 Difference]: With dead ends: 4556 [2022-11-20 10:39:36,015 INFO L226 Difference]: Without dead ends: 3319 [2022-11-20 10:39:36,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:39:36,019 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 704 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:36,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 749 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:39:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2022-11-20 10:39:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3099. [2022-11-20 10:39:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2462 states have (on average 1.3456539398862712) internal successors, (3313), 2516 states have internal predecessors, (3313), 349 states have call successors, (349), 245 states have call predecessors, (349), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2022-11-20 10:39:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4183 transitions. [2022-11-20 10:39:36,493 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4183 transitions. Word has length 65 [2022-11-20 10:39:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:36,493 INFO L495 AbstractCegarLoop]: Abstraction has 3099 states and 4183 transitions. [2022-11-20 10:39:36,494 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-11-20 10:39:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4183 transitions. [2022-11-20 10:39:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:39:36,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:36,497 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-11-20 10:39:36,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:39:36,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:36,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2022-11-20 10:39:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:36,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202157258] [2022-11-20 10:39:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:36,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202157258] [2022-11-20 10:39:36,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202157258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:36,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:36,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:36,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321146906] [2022-11-20 10:39:36,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:36,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:36,645 INFO L87 Difference]: Start difference. First operand 3099 states and 4183 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:39:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:37,929 INFO L93 Difference]: Finished difference Result 6174 states and 8162 transitions. [2022-11-20 10:39:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:39:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-20 10:39:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:37,954 INFO L225 Difference]: With dead ends: 6174 [2022-11-20 10:39:37,954 INFO L226 Difference]: Without dead ends: 4742 [2022-11-20 10:39:37,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:39:37,959 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 820 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:37,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 484 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:39:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2022-11-20 10:39:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4470. [2022-11-20 10:39:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4470 states, 3528 states have (on average 1.312358276643991) internal successors, (4630), 3603 states have internal predecessors, (4630), 501 states have call successors, (501), 368 states have call predecessors, (501), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2022-11-20 10:39:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5924 transitions. [2022-11-20 10:39:38,624 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5924 transitions. Word has length 65 [2022-11-20 10:39:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:38,625 INFO L495 AbstractCegarLoop]: Abstraction has 4470 states and 5924 transitions. [2022-11-20 10:39:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:39:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5924 transitions. [2022-11-20 10:39:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 10:39:38,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39: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] [2022-11-20 10:39:38,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:39:38,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2022-11-20 10:39:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:38,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535315523] [2022-11-20 10:39:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:38,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535315523] [2022-11-20 10:39:38,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535315523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:38,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:38,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:39:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166225479] [2022-11-20 10:39:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:38,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:39:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:38,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:39:38,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:39:38,731 INFO L87 Difference]: Start difference. First operand 4470 states and 5924 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:39:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:40,116 INFO L93 Difference]: Finished difference Result 9488 states and 12438 transitions. [2022-11-20 10:39:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:39:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-20 10:39:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:40,156 INFO L225 Difference]: With dead ends: 9488 [2022-11-20 10:39:40,156 INFO L226 Difference]: Without dead ends: 6664 [2022-11-20 10:39:40,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:39:40,168 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 392 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:40,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 727 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:39:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2022-11-20 10:39:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6148. [2022-11-20 10:39:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 4813 states have (on average 1.2944109702888011) internal successors, (6230), 4895 states have internal predecessors, (6230), 695 states have call successors, (695), 542 states have call predecessors, (695), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2022-11-20 10:39:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8039 transitions. [2022-11-20 10:39:41,302 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8039 transitions. Word has length 66 [2022-11-20 10:39:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:41,304 INFO L495 AbstractCegarLoop]: Abstraction has 6148 states and 8039 transitions. [2022-11-20 10:39:41,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:39:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8039 transitions. [2022-11-20 10:39:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 10:39:41,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:41,308 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:41,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:39:41,309 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2022-11-20 10:39:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:41,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122466605] [2022-11-20 10:39:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:41,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122466605] [2022-11-20 10:39:41,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122466605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:41,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:41,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866877719] [2022-11-20 10:39:41,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:41,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:41,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:41,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:41,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:41,425 INFO L87 Difference]: Start difference. First operand 6148 states and 8039 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 10:39:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:42,992 INFO L93 Difference]: Finished difference Result 7778 states and 10041 transitions. [2022-11-20 10:39:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:39:42,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-11-20 10:39:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:43,030 INFO L225 Difference]: With dead ends: 7778 [2022-11-20 10:39:43,030 INFO L226 Difference]: Without dead ends: 7775 [2022-11-20 10:39:43,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:39:43,036 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 960 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:43,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 493 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:39:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2022-11-20 10:39:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 7202. [2022-11-20 10:39:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5616 states have (on average 1.2820512820512822) internal successors, (7200), 5707 states have internal predecessors, (7200), 821 states have call successors, (821), 656 states have call predecessors, (821), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2022-11-20 10:39:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9328 transitions. [2022-11-20 10:39:44,069 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9328 transitions. Word has length 73 [2022-11-20 10:39:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:44,069 INFO L495 AbstractCegarLoop]: Abstraction has 7202 states and 9328 transitions. [2022-11-20 10:39:44,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 10:39:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9328 transitions. [2022-11-20 10:39:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:39:44,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:44,075 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:44,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:39:44,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:44,076 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2022-11-20 10:39:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:44,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509265910] [2022-11-20 10:39:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:44,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509265910] [2022-11-20 10:39:44,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509265910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:44,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465157632] [2022-11-20 10:39:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:44,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:44,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:39:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:44,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:39:44,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:45,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465157632] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:45,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:45,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-11-20 10:39:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215509553] [2022-11-20 10:39:45,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:45,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:39:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:39:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:39:45,321 INFO L87 Difference]: Start difference. First operand 7202 states and 9328 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-20 10:39:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:49,665 INFO L93 Difference]: Finished difference Result 14848 states and 18856 transitions. [2022-11-20 10:39:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:39:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-11-20 10:39:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:49,737 INFO L225 Difference]: With dead ends: 14848 [2022-11-20 10:39:49,737 INFO L226 Difference]: Without dead ends: 14845 [2022-11-20 10:39:49,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-11-20 10:39:49,745 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 1159 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:49,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1462 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 10:39:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14845 states. [2022-11-20 10:39:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14845 to 12460. [2022-11-20 10:39:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12460 states, 9708 states have (on average 1.2679233621755253) internal successors, (12309), 9851 states have internal predecessors, (12309), 1387 states have call successors, (1387), 1146 states have call predecessors, (1387), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2022-11-20 10:39:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 15942 transitions. [2022-11-20 10:39:51,594 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 15942 transitions. Word has length 74 [2022-11-20 10:39:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:51,595 INFO L495 AbstractCegarLoop]: Abstraction has 12460 states and 15942 transitions. [2022-11-20 10:39:51,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-20 10:39:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 15942 transitions. [2022-11-20 10:39:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 10:39:51,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:51,600 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:51,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:51,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:39:51,808 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2022-11-20 10:39:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:51,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624169952] [2022-11-20 10:39:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624169952] [2022-11-20 10:39:51,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624169952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:51,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:51,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:39:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94592713] [2022-11-20 10:39:51,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:51,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:39:51,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:39:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:39:51,891 INFO L87 Difference]: Start difference. First operand 12460 states and 15942 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 10:39:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:53,930 INFO L93 Difference]: Finished difference Result 19003 states and 24284 transitions. [2022-11-20 10:39:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:39:53,932 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), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-11-20 10:39:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:53,977 INFO L225 Difference]: With dead ends: 19003 [2022-11-20 10:39:53,977 INFO L226 Difference]: Without dead ends: 9065 [2022-11-20 10:39:54,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:39:54,011 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 449 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:54,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 709 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:39:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2022-11-20 10:39:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8513. [2022-11-20 10:39:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8513 states, 6655 states have (on average 1.2545454545454546) internal successors, (8349), 6754 states have internal predecessors, (8349), 954 states have call successors, (954), 770 states have call predecessors, (954), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2022-11-20 10:39:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8513 states to 8513 states and 10768 transitions. [2022-11-20 10:39:55,346 INFO L78 Accepts]: Start accepts. Automaton has 8513 states and 10768 transitions. Word has length 77 [2022-11-20 10:39:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:55,347 INFO L495 AbstractCegarLoop]: Abstraction has 8513 states and 10768 transitions. [2022-11-20 10:39:55,347 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), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 10:39:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8513 states and 10768 transitions. [2022-11-20 10:39:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-20 10:39:55,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:55,353 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 10:39:55,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:39:55,353 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:39:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2022-11-20 10:39:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:55,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779425137] [2022-11-20 10:39:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:39:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:39:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:39:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:39:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:39:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:39:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:39:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:39:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:39:55,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:55,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779425137] [2022-11-20 10:39:55,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779425137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:55,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:55,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:39:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042910655] [2022-11-20 10:39:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:55,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:39:55,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:39:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:55,516 INFO L87 Difference]: Start difference. First operand 8513 states and 10768 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 10:39:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:58,491 INFO L93 Difference]: Finished difference Result 22387 states and 27985 transitions. [2022-11-20 10:39:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:39:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-20 10:39:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:58,565 INFO L225 Difference]: With dead ends: 22387 [2022-11-20 10:39:58,566 INFO L226 Difference]: Without dead ends: 15544 [2022-11-20 10:39:58,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:39:58,592 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 775 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:58,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 843 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:39:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15544 states. [2022-11-20 10:40:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15544 to 14685. [2022-11-20 10:40:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14685 states, 11331 states have (on average 1.2210749271908923) internal successors, (13836), 11536 states have internal predecessors, (13836), 1670 states have call successors, (1670), 1374 states have call predecessors, (1670), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2022-11-20 10:40:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 18374 transitions. [2022-11-20 10:40:00,416 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 18374 transitions. Word has length 84 [2022-11-20 10:40:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:00,417 INFO L495 AbstractCegarLoop]: Abstraction has 14685 states and 18374 transitions. [2022-11-20 10:40:00,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 10:40:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 18374 transitions. [2022-11-20 10:40:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 10:40:00,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:00,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 10:40:00,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:40:00,430 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2022-11-20 10:40:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:00,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208545431] [2022-11-20 10:40:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:40:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:40:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 10:40:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:00,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208545431] [2022-11-20 10:40:00,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208545431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:00,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303942433] [2022-11-20 10:40:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:00,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:00,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:40:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:00,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:40:00,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:40:00,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:00,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303942433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:00,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:00,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 10:40:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637282113] [2022-11-20 10:40:00,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:00,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:00,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:00,759 INFO L87 Difference]: Start difference. First operand 14685 states and 18374 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:02,974 INFO L93 Difference]: Finished difference Result 17754 states and 22695 transitions. [2022-11-20 10:40:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-11-20 10:40:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:03,039 INFO L225 Difference]: With dead ends: 17754 [2022-11-20 10:40:03,039 INFO L226 Difference]: Without dead ends: 15078 [2022-11-20 10:40:03,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:03,053 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:03,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 676 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2022-11-20 10:40:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 15078. [2022-11-20 10:40:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15078 states, 11650 states have (on average 1.2243776824034336) internal successors, (14264), 11859 states have internal predecessors, (14264), 1712 states have call successors, (1712), 1402 states have call predecessors, (1712), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2022-11-20 10:40:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15078 states to 15078 states and 18908 transitions. [2022-11-20 10:40:04,866 INFO L78 Accepts]: Start accepts. Automaton has 15078 states and 18908 transitions. Word has length 93 [2022-11-20 10:40:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:04,867 INFO L495 AbstractCegarLoop]: Abstraction has 15078 states and 18908 transitions. [2022-11-20 10:40:04,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15078 states and 18908 transitions. [2022-11-20 10:40:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 10:40:04,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:04,878 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:04,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:40:05,085 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2022-11-20 10:40:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:05,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900552465] [2022-11-20 10:40:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:40:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:40:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:40:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:40:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:40:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:40:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:40:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:40:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:05,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900552465] [2022-11-20 10:40:05,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900552465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:05,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:05,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:40:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350426891] [2022-11-20 10:40:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:05,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:40:05,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:05,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:40:05,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:40:05,257 INFO L87 Difference]: Start difference. First operand 15078 states and 18908 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-11-20 10:40:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:08,417 INFO L93 Difference]: Finished difference Result 25952 states and 32227 transitions. [2022-11-20 10:40:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:40:08,418 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 93 [2022-11-20 10:40:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:08,478 INFO L225 Difference]: With dead ends: 25952 [2022-11-20 10:40:08,478 INFO L226 Difference]: Without dead ends: 13553 [2022-11-20 10:40:08,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-20 10:40:08,515 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 1147 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:08,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1010 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 10:40:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2022-11-20 10:40:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 12653. [2022-11-20 10:40:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12653 states, 9816 states have (on average 1.2199470252648736) internal successors, (11975), 9992 states have internal predecessors, (11975), 1413 states have call successors, (1413), 1151 states have call predecessors, (1413), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2022-11-20 10:40:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 15652 transitions. [2022-11-20 10:40:10,153 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 15652 transitions. Word has length 93 [2022-11-20 10:40:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:10,154 INFO L495 AbstractCegarLoop]: Abstraction has 12653 states and 15652 transitions. [2022-11-20 10:40:10,154 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-11-20 10:40:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 15652 transitions. [2022-11-20 10:40:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 10:40:10,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:10,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 10:40:10,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:40:10,168 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2022-11-20 10:40:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:10,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201657741] [2022-11-20 10:40:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:40:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 10:40:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:40:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 10:40:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:10,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201657741] [2022-11-20 10:40:10,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201657741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893060316] [2022-11-20 10:40:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:10,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:10,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:10,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:40:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:10,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:40:10,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:40:10,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:10,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893060316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:10,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:10,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-20 10:40:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251312202] [2022-11-20 10:40:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:10,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:10,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:10,631 INFO L87 Difference]: Start difference. First operand 12653 states and 15652 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 10:40:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:12,555 INFO L93 Difference]: Finished difference Result 15507 states and 19695 transitions. [2022-11-20 10:40:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-20 10:40:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:12,608 INFO L225 Difference]: With dead ends: 15507 [2022-11-20 10:40:12,608 INFO L226 Difference]: Without dead ends: 13862 [2022-11-20 10:40:12,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:12,623 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 209 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:12,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13862 states. [2022-11-20 10:40:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13862 to 13818. [2022-11-20 10:40:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13818 states, 10756 states have (on average 1.2332651543324655) internal successors, (13265), 10949 states have internal predecessors, (13265), 1541 states have call successors, (1541), 1236 states have call predecessors, (1541), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2022-11-20 10:40:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13818 states to 13818 states and 17250 transitions. [2022-11-20 10:40:14,204 INFO L78 Accepts]: Start accepts. Automaton has 13818 states and 17250 transitions. Word has length 119 [2022-11-20 10:40:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:14,205 INFO L495 AbstractCegarLoop]: Abstraction has 13818 states and 17250 transitions. [2022-11-20 10:40:14,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 10:40:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 13818 states and 17250 transitions. [2022-11-20 10:40:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 10:40:14,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:14,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:14,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:14,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:14,429 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2022-11-20 10:40:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749736161] [2022-11-20 10:40:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:40:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:40:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:40:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 10:40:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-20 10:40:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:14,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749736161] [2022-11-20 10:40:14,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749736161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:14,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409300122] [2022-11-20 10:40:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:14,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:14,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:14,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:40:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:14,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:40:14,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 10:40:14,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:14,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409300122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:14,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:14,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 10:40:14,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101572678] [2022-11-20 10:40:14,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:14,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:14,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:14,953 INFO L87 Difference]: Start difference. First operand 13818 states and 17250 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 10:40:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:16,333 INFO L93 Difference]: Finished difference Result 17504 states and 22428 transitions. [2022-11-20 10:40:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:16,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-11-20 10:40:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:16,371 INFO L225 Difference]: With dead ends: 17504 [2022-11-20 10:40:16,371 INFO L226 Difference]: Without dead ends: 14312 [2022-11-20 10:40:16,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:16,387 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 260 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:16,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2022-11-20 10:40:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 14202. [2022-11-20 10:40:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14202 states, 11115 states have (on average 1.2191632928475034) internal successors, (13551), 11303 states have internal predecessors, (13551), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-11-20 10:40:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14202 states to 14202 states and 17514 transitions. [2022-11-20 10:40:18,213 INFO L78 Accepts]: Start accepts. Automaton has 14202 states and 17514 transitions. Word has length 135 [2022-11-20 10:40:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:18,214 INFO L495 AbstractCegarLoop]: Abstraction has 14202 states and 17514 transitions. [2022-11-20 10:40:18,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 10:40:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14202 states and 17514 transitions. [2022-11-20 10:40:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 10:40:18,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:18,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:18,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 10:40:18,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:18,438 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2022-11-20 10:40:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:18,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118060343] [2022-11-20 10:40:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:40:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:40:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:40:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 10:40:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-20 10:40:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118060343] [2022-11-20 10:40:18,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118060343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:18,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694162405] [2022-11-20 10:40:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:18,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:18,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:18,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:40:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:18,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:40:18,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 10:40:18,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:18,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694162405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:18,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 10:40:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966281759] [2022-11-20 10:40:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:18,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:18,805 INFO L87 Difference]: Start difference. First operand 14202 states and 17514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 10:40:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:20,361 INFO L93 Difference]: Finished difference Result 17861 states and 22355 transitions. [2022-11-20 10:40:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:20,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-11-20 10:40:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:20,400 INFO L225 Difference]: With dead ends: 17861 [2022-11-20 10:40:20,400 INFO L226 Difference]: Without dead ends: 14287 [2022-11-20 10:40:20,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:20,412 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 248 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:20,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14287 states. [2022-11-20 10:40:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14287 to 14172. [2022-11-20 10:40:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14172 states, 11085 states have (on average 1.211637347767253) internal successors, (13431), 11273 states have internal predecessors, (13431), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-11-20 10:40:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 17394 transitions. [2022-11-20 10:40:22,147 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 17394 transitions. Word has length 135 [2022-11-20 10:40:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:22,147 INFO L495 AbstractCegarLoop]: Abstraction has 14172 states and 17394 transitions. [2022-11-20 10:40:22,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 10:40:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 17394 transitions. [2022-11-20 10:40:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 10:40:22,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:22,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:22,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:22,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:22,370 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:22,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2022-11-20 10:40:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:22,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665279881] [2022-11-20 10:40:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:40:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:40:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:40:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:40:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-20 10:40:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:22,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665279881] [2022-11-20 10:40:22,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665279881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875762313] [2022-11-20 10:40:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:22,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:22,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:40:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:22,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:40:22,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:40:22,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:22,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875762313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:22,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:22,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 10:40:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417179040] [2022-11-20 10:40:22,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:22,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:40:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:40:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:22,790 INFO L87 Difference]: Start difference. First operand 14172 states and 17394 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:40:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:24,325 INFO L93 Difference]: Finished difference Result 15677 states and 19438 transitions. [2022-11-20 10:40:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:40:24,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-11-20 10:40:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:24,367 INFO L225 Difference]: With dead ends: 15677 [2022-11-20 10:40:24,368 INFO L226 Difference]: Without dead ends: 13893 [2022-11-20 10:40:24,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:40:24,376 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 88 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:24,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 650 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2022-11-20 10:40:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 13829. [2022-11-20 10:40:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10810 states have (on average 1.2055504162812212) internal successors, (13032), 10994 states have internal predecessors, (13032), 1501 states have call successors, (1501), 1237 states have call predecessors, (1501), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2022-11-20 10:40:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16895 transitions. [2022-11-20 10:40:26,157 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16895 transitions. Word has length 136 [2022-11-20 10:40:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:26,158 INFO L495 AbstractCegarLoop]: Abstraction has 13829 states and 16895 transitions. [2022-11-20 10:40:26,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:40:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16895 transitions. [2022-11-20 10:40:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-20 10:40:26,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:26,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:26,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:26,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 10:40:26,375 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2022-11-20 10:40:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:26,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176530292] [2022-11-20 10:40:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:40:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:40:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:40:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:40:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-20 10:40:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176530292] [2022-11-20 10:40:26,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176530292] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219992193] [2022-11-20 10:40:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:26,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:26,538 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:26,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:40:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:26,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:40:26,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-20 10:40:26,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:26,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219992193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:26,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:26,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-20 10:40:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132152510] [2022-11-20 10:40:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:26,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:40:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:40:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:40:26,801 INFO L87 Difference]: Start difference. First operand 13829 states and 16895 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:28,614 INFO L93 Difference]: Finished difference Result 15723 states and 19305 transitions. [2022-11-20 10:40:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:40:28,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-20 10:40:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:28,643 INFO L225 Difference]: With dead ends: 15723 [2022-11-20 10:40:28,643 INFO L226 Difference]: Without dead ends: 12689 [2022-11-20 10:40:28,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:40:28,653 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 340 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:28,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 426 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:40:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2022-11-20 10:40:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 12501. [2022-11-20 10:40:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12501 states, 9730 states have (on average 1.18879753340185) internal successors, (11567), 9890 states have internal predecessors, (11567), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-11-20 10:40:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 15067 transitions. [2022-11-20 10:40:30,537 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 15067 transitions. Word has length 137 [2022-11-20 10:40:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:30,537 INFO L495 AbstractCegarLoop]: Abstraction has 12501 states and 15067 transitions. [2022-11-20 10:40:30,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 15067 transitions. [2022-11-20 10:40:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-20 10:40:30,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:30,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:30,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:30,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 10:40:30,751 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2022-11-20 10:40:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:30,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535964090] [2022-11-20 10:40:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:40:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:40:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:40:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:40:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-20 10:40:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:30,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535964090] [2022-11-20 10:40:30,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535964090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:30,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984196754] [2022-11-20 10:40:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:30,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:30,933 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:30,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:40:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:31,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:40:31,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 10:40:31,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:31,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984196754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:31,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:31,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-20 10:40:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123173836] [2022-11-20 10:40:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:31,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:40:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:31,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:40:31,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:40:31,150 INFO L87 Difference]: Start difference. First operand 12501 states and 15067 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:32,618 INFO L93 Difference]: Finished difference Result 14431 states and 17466 transitions. [2022-11-20 10:40:32,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:40:32,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-20 10:40:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:32,659 INFO L225 Difference]: With dead ends: 14431 [2022-11-20 10:40:32,659 INFO L226 Difference]: Without dead ends: 12557 [2022-11-20 10:40:32,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:40:32,667 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:32,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2022-11-20 10:40:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12525. [2022-11-20 10:40:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12525 states, 9754 states have (on average 1.1847447201148247) internal successors, (11556), 9914 states have internal predecessors, (11556), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-11-20 10:40:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12525 states to 12525 states and 15056 transitions. [2022-11-20 10:40:34,120 INFO L78 Accepts]: Start accepts. Automaton has 12525 states and 15056 transitions. Word has length 137 [2022-11-20 10:40:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:34,121 INFO L495 AbstractCegarLoop]: Abstraction has 12525 states and 15056 transitions. [2022-11-20 10:40:34,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 12525 states and 15056 transitions. [2022-11-20 10:40:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-20 10:40:34,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:34,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:34,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:34,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:34,330 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2022-11-20 10:40:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:34,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946542819] [2022-11-20 10:40:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:40:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:40:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:40:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:40:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-20 10:40:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:34,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946542819] [2022-11-20 10:40:34,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946542819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:34,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:34,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:40:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868262796] [2022-11-20 10:40:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:34,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:40:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:40:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:40:34,511 INFO L87 Difference]: Start difference. First operand 12525 states and 15056 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 10:40:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:37,270 INFO L93 Difference]: Finished difference Result 13983 states and 16730 transitions. [2022-11-20 10:40:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:40:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-11-20 10:40:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:37,299 INFO L225 Difference]: With dead ends: 13983 [2022-11-20 10:40:37,300 INFO L226 Difference]: Without dead ends: 13980 [2022-11-20 10:40:37,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:40:37,304 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 738 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:37,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 716 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:40:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2022-11-20 10:40:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13496. [2022-11-20 10:40:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13496 states, 10552 states have (on average 1.182524639878696) internal successors, (12478), 10722 states have internal predecessors, (12478), 1454 states have call successors, (1454), 1207 states have call predecessors, (1454), 1488 states have return successors, (2252), 1577 states have call predecessors, (2252), 1451 states have call successors, (2252) [2022-11-20 10:40:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 16184 transitions. [2022-11-20 10:40:38,860 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 16184 transitions. Word has length 137 [2022-11-20 10:40:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:38,861 INFO L495 AbstractCegarLoop]: Abstraction has 13496 states and 16184 transitions. [2022-11-20 10:40:38,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 10:40:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 16184 transitions. [2022-11-20 10:40:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-20 10:40:38,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:38,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 10:40:38,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:40:38,873 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2022-11-20 10:40:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:38,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524595961] [2022-11-20 10:40:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:38,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:40:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:38,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:40:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:40:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:40:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:40:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:40:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:40:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:40:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:40:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:40:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:40:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:40:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:40:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:40:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 10:40:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-20 10:40:39,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:39,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524595961] [2022-11-20 10:40:39,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524595961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:39,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020258749] [2022-11-20 10:40:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:39,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:39,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:39,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:40:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:39,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:40:39,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:40:39,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:40:39,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020258749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:39,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:40:39,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-11-20 10:40:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84578036] [2022-11-20 10:40:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:39,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:40:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:40:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:40:39,256 INFO L87 Difference]: Start difference. First operand 13496 states and 16184 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 10:40:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:40,376 INFO L93 Difference]: Finished difference Result 18644 states and 22404 transitions. [2022-11-20 10:40:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:40:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-11-20 10:40:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:40,477 INFO L225 Difference]: With dead ends: 18644 [2022-11-20 10:40:40,477 INFO L226 Difference]: Without dead ends: 8062 [2022-11-20 10:40:40,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:40:40,487 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 34 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:40,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:40:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-11-20 10:40:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7620. [2022-11-20 10:40:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 6117 states have (on average 1.1678927578878535) internal successors, (7144), 6185 states have internal predecessors, (7144), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-11-20 10:40:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 8992 transitions. [2022-11-20 10:40:41,266 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 8992 transitions. Word has length 145 [2022-11-20 10:40:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:41,267 INFO L495 AbstractCegarLoop]: Abstraction has 7620 states and 8992 transitions. [2022-11-20 10:40:41,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 10:40:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 8992 transitions. [2022-11-20 10:40:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-20 10:40:41,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:41,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:41,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:41,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 10:40:41,476 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2022-11-20 10:40:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:41,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370655306] [2022-11-20 10:40:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:40:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:40:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:40:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:40:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 10:40:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:40:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:40:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:40:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:40:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:40:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-20 10:40:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370655306] [2022-11-20 10:40:41,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370655306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:40:41,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:40:41,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:40:41,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474023081] [2022-11-20 10:40:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:40:41,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:40:41,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:40:41,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:40:41,591 INFO L87 Difference]: Start difference. First operand 7620 states and 8992 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:43,149 INFO L93 Difference]: Finished difference Result 10269 states and 12313 transitions. [2022-11-20 10:40:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:40:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-11-20 10:40:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:43,174 INFO L225 Difference]: With dead ends: 10269 [2022-11-20 10:40:43,175 INFO L226 Difference]: Without dead ends: 8441 [2022-11-20 10:40:43,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:40:43,181 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 251 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:43,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 695 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:40:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2022-11-20 10:40:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 7623. [2022-11-20 10:40:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7623 states, 6120 states have (on average 1.16781045751634) internal successors, (7147), 6188 states have internal predecessors, (7147), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-11-20 10:40:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 8995 transitions. [2022-11-20 10:40:44,090 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 8995 transitions. Word has length 141 [2022-11-20 10:40:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:44,091 INFO L495 AbstractCegarLoop]: Abstraction has 7623 states and 8995 transitions. [2022-11-20 10:40:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:40:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 8995 transitions. [2022-11-20 10:40:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-20 10:40:44,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:44,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:44,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 10:40:44,099 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:40:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2022-11-20 10:40:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:44,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426233070] [2022-11-20 10:40:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:40:44,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:40:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:40:44,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:40:44,197 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:40:44,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-20 10:40:44,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-20 10:40:44,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 10:40:44,205 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:44,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:40:44,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:40:44 BoogieIcfgContainer [2022-11-20 10:40:44,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:40:44,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:40:44,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:40:44,379 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:40:44,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:39:15" (3/4) ... [2022-11-20 10:40:44,382 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:40:44,515 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:40:44,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:40:44,516 INFO L158 Benchmark]: Toolchain (without parser) took 90524.27ms. Allocated memory was 163.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 121.7MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,517 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 163.6MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:40:44,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.26ms. Allocated memory is still 163.6MB. Free memory was 121.7MB in the beginning and 104.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.73ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 102.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,518 INFO L158 Benchmark]: Boogie Preprocessor took 69.93ms. Allocated memory is still 163.6MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,518 INFO L158 Benchmark]: RCFGBuilder took 1000.90ms. Allocated memory is still 163.6MB. Free memory was 100.0MB in the beginning and 72.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,519 INFO L158 Benchmark]: TraceAbstraction took 88725.73ms. Allocated memory was 163.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 72.1MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,519 INFO L158 Benchmark]: Witness Printer took 136.82ms. Allocated memory is still 4.3GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 10:40:44,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 163.6MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.26ms. Allocated memory is still 163.6MB. Free memory was 121.7MB in the beginning and 104.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.73ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 102.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.93ms. Allocated memory is still 163.6MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1000.90ms. Allocated memory is still 163.6MB. Free memory was 100.0MB in the beginning and 72.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 88725.73ms. Allocated memory was 163.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 72.1MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. * Witness Printer took 136.82ms. Allocated memory is still 4.3GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 88.5s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 50.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15375 SdHoareTripleChecker+Valid, 17.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14998 mSDsluCounter, 22766 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15933 mSDsCounter, 3389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15782 IncrementalHoareTripleChecker+Invalid, 19171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3389 mSolverCounterUnsat, 6833 mSDtfsCounter, 15782 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1756 SyntacticMatches, 5 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15078occurred in iteration=18, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 9769 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3674 ConstructedInterpolants, 0 QuantifiedInterpolants, 7257 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1262/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:40:44,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d48cfd-bb48-4a77-a5b0-653bcc17e346/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE