./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa --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 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:02:14,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:02:14,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:02:14,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:02:14,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:02:14,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:02:14,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:02:14,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:02:14,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:02:14,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:02:14,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:02:14,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:02:14,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:02:14,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:02:14,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:02:14,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:02:14,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:02:14,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:02:14,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:02:14,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:02:14,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:02:14,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:02:14,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:02:14,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:02:14,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:02:14,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:02:14,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:02:14,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:02:14,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:02:14,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:02:14,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:02:14,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:02:14,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:02:14,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:02:14,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:02:14,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:02:14,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:02:14,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:02:14,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:02:14,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:02:14,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:02:14,523 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:02:14,540 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:02:14,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:02:14,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:02:14,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:02:14,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:02:14,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:02:14,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:02:14,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:02:14,542 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:02:14,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:02:14,542 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:02:14,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:02:14,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:02:14,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:02:14,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:02:14,545 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:02:14,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:02:14,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:02:14,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:02:14,545 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_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/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_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa 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 -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2021-12-06 19:02:14,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:02:14,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:02:14,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:02:14,757 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:02:14,758 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:02:14,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2021-12-06 19:02:14,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/data/b1f8e2289/f146e5e4158a4fe5bada0d24c903253c/FLAGfe93b8443 [2021-12-06 19:02:15,187 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:02:15,188 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2021-12-06 19:02:15,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/data/b1f8e2289/f146e5e4158a4fe5bada0d24c903253c/FLAGfe93b8443 [2021-12-06 19:02:15,206 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/data/b1f8e2289/f146e5e4158a4fe5bada0d24c903253c [2021-12-06 19:02:15,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:02:15,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:02:15,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:02:15,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:02:15,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:02:15,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563b8aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15, skipping insertion in model container [2021-12-06 19:02:15,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:02:15,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:02:15,384 WARN L230 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_a34776ec-a970-4f07-8c85-56b07ba78d4f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2021-12-06 19:02:15,418 WARN L230 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_a34776ec-a970-4f07-8c85-56b07ba78d4f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2021-12-06 19:02:15,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:02:15,450 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:02:15,459 WARN L230 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_a34776ec-a970-4f07-8c85-56b07ba78d4f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2021-12-06 19:02:15,474 WARN L230 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_a34776ec-a970-4f07-8c85-56b07ba78d4f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2021-12-06 19:02:15,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:02:15,505 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:02:15,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15 WrapperNode [2021-12-06 19:02:15,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:02:15,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:02:15,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:02:15,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:02:15,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,547 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2021-12-06 19:02:15,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:02:15,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:02:15,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:02:15,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:02:15,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:02:15,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:02:15,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:02:15,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:02:15,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (1/1) ... [2021-12-06 19:02:15,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:02:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:15,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:02:15,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:02:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:02:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 19:02:15,650 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 19:02:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 19:02:15,650 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 19:02:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 19:02:15,650 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 19:02:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 19:02:15,650 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 19:02:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 19:02:15,651 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 19:02:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 19:02:15,651 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 19:02:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 19:02:15,651 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 19:02:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 19:02:15,651 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 19:02:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 19:02:15,652 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 19:02:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 19:02:15,652 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 19:02:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 19:02:15,652 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 19:02:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:02:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 19:02:15,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 19:02:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 19:02:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 19:02:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:02:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:02:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 19:02:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 19:02:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-06 19:02:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-06 19:02:15,722 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:02:15,724 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:02:16,102 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:02:16,109 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:02:16,110 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-06 19:02:16,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:02:16 BoogieIcfgContainer [2021-12-06 19:02:16,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:02:16,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:02:16,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:02:16,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:02:16,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:02:15" (1/3) ... [2021-12-06 19:02:16,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769ee87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:02:16, skipping insertion in model container [2021-12-06 19:02:16,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:02:15" (2/3) ... [2021-12-06 19:02:16,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769ee87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:02:16, skipping insertion in model container [2021-12-06 19:02:16,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:02:16" (3/3) ... [2021-12-06 19:02:16,124 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2021-12-06 19:02:16,127 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:02:16,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 19:02:16,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:02:16,177 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:02:16,177 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 19:02:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 19:02:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:16,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:16,211 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:16,211 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2021-12-06 19:02:16,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391597959] [2021-12-06 19:02:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:16,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:16,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391597959] [2021-12-06 19:02:16,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391597959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:16,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:16,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:02:16,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738146389] [2021-12-06 19:02:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:16,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:02:16,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:02:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:02:16,496 INFO L87 Difference]: Start difference. First operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:02:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:16,847 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2021-12-06 19:02:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:02:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 19:02:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:16,858 INFO L225 Difference]: With dead ends: 482 [2021-12-06 19:02:16,859 INFO L226 Difference]: Without dead ends: 248 [2021-12-06 19:02:16,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:16,865 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 351 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:16,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 923 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-06 19:02:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2021-12-06 19:02:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-06 19:02:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2021-12-06 19:02:16,913 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2021-12-06 19:02:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:16,914 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2021-12-06 19:02:16,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 19:02:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2021-12-06 19:02:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:16,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:16,917 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:16,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:02:16,917 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2021-12-06 19:02:16,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053729604] [2021-12-06 19:02:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:16,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:17,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:17,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053729604] [2021-12-06 19:02:17,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053729604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:17,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:17,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:02:17,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128211735] [2021-12-06 19:02:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:17,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:02:17,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:17,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:02:17,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:17,032 INFO L87 Difference]: Start difference. First operand 230 states and 328 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) [2021-12-06 19:02:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:17,452 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2021-12-06 19:02:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:02:17,452 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 [2021-12-06 19:02:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:17,457 INFO L225 Difference]: With dead ends: 453 [2021-12-06 19:02:17,457 INFO L226 Difference]: Without dead ends: 365 [2021-12-06 19:02:17,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:02:17,460 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 592 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:17,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 1008 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:02:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-06 19:02:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2021-12-06 19:02:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2021-12-06 19:02:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2021-12-06 19:02:17,496 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2021-12-06 19:02:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:17,497 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2021-12-06 19:02:17,497 INFO L471 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) [2021-12-06 19:02:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2021-12-06 19:02:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:17,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:17,500 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:17,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:02:17,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2021-12-06 19:02:17,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:17,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138740439] [2021-12-06 19:02:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:17,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:17,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:17,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138740439] [2021-12-06 19:02:17,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138740439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:17,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:17,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:02:17,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245773564] [2021-12-06 19:02:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:17,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:02:17,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:02:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:02:17,605 INFO L87 Difference]: Start difference. First operand 326 states and 459 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) [2021-12-06 19:02:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:18,002 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2021-12-06 19:02:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:02:18,003 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 [2021-12-06 19:02:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:18,006 INFO L225 Difference]: With dead ends: 540 [2021-12-06 19:02:18,006 INFO L226 Difference]: Without dead ends: 363 [2021-12-06 19:02:18,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:02:18,008 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 252 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:18,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1595 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:02:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-06 19:02:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2021-12-06 19:02:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2021-12-06 19:02:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2021-12-06 19:02:18,033 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2021-12-06 19:02:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:18,033 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2021-12-06 19:02:18,033 INFO L471 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) [2021-12-06 19:02:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2021-12-06 19:02:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:18,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:18,036 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:18,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:02:18,036 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2021-12-06 19:02:18,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:18,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653384911] [2021-12-06 19:02:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:18,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:18,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:18,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653384911] [2021-12-06 19:02:18,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653384911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:18,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:18,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:02:18,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488233770] [2021-12-06 19:02:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:18,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:02:18,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:02:18,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:02:18,131 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 19:02:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:19,164 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2021-12-06 19:02:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 19:02:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-12-06 19:02:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:19,170 INFO L225 Difference]: With dead ends: 1231 [2021-12-06 19:02:19,170 INFO L226 Difference]: Without dead ends: 1037 [2021-12-06 19:02:19,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 19:02:19,173 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 1873 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:19,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1889 Valid, 1727 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 19:02:19,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-12-06 19:02:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2021-12-06 19:02:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2021-12-06 19:02:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2021-12-06 19:02:19,220 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2021-12-06 19:02:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:19,221 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2021-12-06 19:02:19,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 19:02:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2021-12-06 19:02:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:19,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:19,222 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:19,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:02:19,222 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:19,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2021-12-06 19:02:19,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:19,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535225449] [2021-12-06 19:02:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:19,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:19,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:19,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535225449] [2021-12-06 19:02:19,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535225449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:19,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:19,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:02:19,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330395672] [2021-12-06 19:02:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:19,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:02:19,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:19,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:02:19,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:02:19,314 INFO L87 Difference]: Start difference. First operand 912 states and 1204 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) [2021-12-06 19:02:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:19,709 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2021-12-06 19:02:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 19:02:19,709 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 [2021-12-06 19:02:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:19,714 INFO L225 Difference]: With dead ends: 1793 [2021-12-06 19:02:19,714 INFO L226 Difference]: Without dead ends: 1024 [2021-12-06 19:02:19,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:02:19,717 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 372 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:19,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1429 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:02:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-12-06 19:02:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2021-12-06 19:02:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2021-12-06 19:02:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2021-12-06 19:02:19,764 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2021-12-06 19:02:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:19,764 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2021-12-06 19:02:19,764 INFO L471 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) [2021-12-06 19:02:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2021-12-06 19:02:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:19,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:19,765 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:19,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 19:02:19,765 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2021-12-06 19:02:19,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:19,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418358481] [2021-12-06 19:02:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:19,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:19,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:19,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418358481] [2021-12-06 19:02:19,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418358481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:19,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:19,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:02:19,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339677079] [2021-12-06 19:02:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:19,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:02:19,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:02:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:19,841 INFO L87 Difference]: Start difference. First operand 932 states and 1219 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) [2021-12-06 19:02:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:20,351 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2021-12-06 19:02:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 19:02:20,352 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 [2021-12-06 19:02:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:20,360 INFO L225 Difference]: With dead ends: 2500 [2021-12-06 19:02:20,360 INFO L226 Difference]: Without dead ends: 1712 [2021-12-06 19:02:20,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-06 19:02:20,363 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 650 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:20,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 1173 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:02:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2021-12-06 19:02:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2021-12-06 19:02:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2021-12-06 19:02:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2021-12-06 19:02:20,433 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2021-12-06 19:02:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:20,433 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2021-12-06 19:02:20,434 INFO L471 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) [2021-12-06 19:02:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2021-12-06 19:02:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 19:02:20,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:20,435 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:20,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 19:02:20,435 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2021-12-06 19:02:20,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:20,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7964655] [2021-12-06 19:02:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:20,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:20,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:20,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7964655] [2021-12-06 19:02:20,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7964655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:20,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:20,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:20,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438717405] [2021-12-06 19:02:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:20,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:20,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:20,511 INFO L87 Difference]: Start difference. First operand 1380 states and 1786 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) [2021-12-06 19:02:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:20,899 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2021-12-06 19:02:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 19:02:20,900 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 [2021-12-06 19:02:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:20,916 INFO L225 Difference]: With dead ends: 3851 [2021-12-06 19:02:20,916 INFO L226 Difference]: Without dead ends: 2617 [2021-12-06 19:02:20,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-06 19:02:20,921 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 772 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:20,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 780 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2021-12-06 19:02:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2021-12-06 19:02:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2021-12-06 19:02:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2021-12-06 19:02:21,063 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2021-12-06 19:02:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:21,063 INFO L470 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2021-12-06 19:02:21,063 INFO L471 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) [2021-12-06 19:02:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2021-12-06 19:02:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 19:02:21,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:21,065 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:21,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 19:02:21,065 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2021-12-06 19:02:21,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:21,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630427898] [2021-12-06 19:02:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:21,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:21,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630427898] [2021-12-06 19:02:21,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630427898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:21,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:21,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:02:21,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335717326] [2021-12-06 19:02:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:21,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:02:21,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:21,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:02:21,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:02:21,133 INFO L87 Difference]: Start difference. First operand 2509 states and 3170 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) [2021-12-06 19:02:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:21,545 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2021-12-06 19:02:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:02:21,546 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 [2021-12-06 19:02:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:21,567 INFO L225 Difference]: With dead ends: 5831 [2021-12-06 19:02:21,567 INFO L226 Difference]: Without dead ends: 3468 [2021-12-06 19:02:21,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:21,574 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:21,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 931 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:02:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-12-06 19:02:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2021-12-06 19:02:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2021-12-06 19:02:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2021-12-06 19:02:21,738 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2021-12-06 19:02:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:21,739 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2021-12-06 19:02:21,739 INFO L471 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) [2021-12-06 19:02:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2021-12-06 19:02:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:21,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:21,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:21,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 19:02:21,740 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2021-12-06 19:02:21,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:21,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357560314] [2021-12-06 19:02:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:21,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:21,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:21,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357560314] [2021-12-06 19:02:21,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357560314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:21,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:21,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:02:21,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590279788] [2021-12-06 19:02:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:21,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:02:21,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:02:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:02:21,789 INFO L87 Difference]: Start difference. First operand 3214 states and 4017 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:02:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:22,164 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2021-12-06 19:02:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:02:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:02:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:22,182 INFO L225 Difference]: With dead ends: 3374 [2021-12-06 19:02:22,182 INFO L226 Difference]: Without dead ends: 3246 [2021-12-06 19:02:22,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:02:22,184 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 396 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:22,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 680 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2021-12-06 19:02:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2021-12-06 19:02:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2021-12-06 19:02:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2021-12-06 19:02:22,345 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2021-12-06 19:02:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:22,345 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2021-12-06 19:02:22,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:02:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2021-12-06 19:02:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:22,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:22,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:22,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 19:02:22,346 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2021-12-06 19:02:22,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:22,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489978262] [2021-12-06 19:02:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:22,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:22,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:22,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489978262] [2021-12-06 19:02:22,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489978262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:22,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:22,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:02:22,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262091191] [2021-12-06 19:02:22,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:22,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:02:22,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:02:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:02:22,401 INFO L87 Difference]: Start difference. First operand 3214 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-12-06 19:02:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:22,932 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2021-12-06 19:02:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:02:22,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:22,948 INFO L225 Difference]: With dead ends: 3524 [2021-12-06 19:02:22,949 INFO L226 Difference]: Without dead ends: 3400 [2021-12-06 19:02:22,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:22,951 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 637 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:22,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 885 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:02:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2021-12-06 19:02:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2021-12-06 19:02:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2021-12-06 19:02:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2021-12-06 19:02:23,100 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2021-12-06 19:02:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:23,100 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2021-12-06 19:02:23,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-12-06 19:02:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2021-12-06 19:02:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:23,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:23,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:23,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 19:02:23,102 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2021-12-06 19:02:23,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:23,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988174181] [2021-12-06 19:02:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:23,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:23,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988174181] [2021-12-06 19:02:23,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988174181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:23,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:23,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:23,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317682346] [2021-12-06 19:02:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:23,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:23,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:23,161 INFO L87 Difference]: Start difference. First operand 3335 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:23,769 INFO L93 Difference]: Finished difference Result 3797 states and 4891 transitions. [2021-12-06 19:02:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:02:23,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:23,783 INFO L225 Difference]: With dead ends: 3797 [2021-12-06 19:02:23,783 INFO L226 Difference]: Without dead ends: 3552 [2021-12-06 19:02:23,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:02:23,785 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 629 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:23,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 1358 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:02:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2021-12-06 19:02:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3449. [2021-12-06 19:02:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2021-12-06 19:02:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4363 transitions. [2021-12-06 19:02:23,947 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4363 transitions. Word has length 69 [2021-12-06 19:02:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:23,947 INFO L470 AbstractCegarLoop]: Abstraction has 3449 states and 4363 transitions. [2021-12-06 19:02:23,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4363 transitions. [2021-12-06 19:02:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:23,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:23,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:23,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 19:02:23,949 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2021-12-06 19:02:23,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:23,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099706552] [2021-12-06 19:02:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:23,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:23,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:24,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099706552] [2021-12-06 19:02:24,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099706552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:24,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:24,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:24,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925179494] [2021-12-06 19:02:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:24,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:24,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:24,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:24,009 INFO L87 Difference]: Start difference. First operand 3449 states and 4363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:24,651 INFO L93 Difference]: Finished difference Result 4271 states and 5591 transitions. [2021-12-06 19:02:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:02:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:24,667 INFO L225 Difference]: With dead ends: 4271 [2021-12-06 19:02:24,667 INFO L226 Difference]: Without dead ends: 3912 [2021-12-06 19:02:24,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:02:24,670 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 676 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:24,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 1082 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:02:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2021-12-06 19:02:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3675. [2021-12-06 19:02:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 2902 states have (on average 1.2960027567195038) internal successors, (3761), 2957 states have internal predecessors, (3761), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2021-12-06 19:02:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4698 transitions. [2021-12-06 19:02:24,831 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4698 transitions. Word has length 69 [2021-12-06 19:02:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:24,831 INFO L470 AbstractCegarLoop]: Abstraction has 3675 states and 4698 transitions. [2021-12-06 19:02:24,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4698 transitions. [2021-12-06 19:02:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:24,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:24,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:24,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 19:02:24,834 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2021-12-06 19:02:24,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:24,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153914263] [2021-12-06 19:02:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:24,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:24,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:24,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153914263] [2021-12-06 19:02:24,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153914263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:24,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:24,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:24,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231727146] [2021-12-06 19:02:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:24,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:24,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:24,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:24,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:24,889 INFO L87 Difference]: Start difference. First operand 3675 states and 4698 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:25,583 INFO L93 Difference]: Finished difference Result 5061 states and 6758 transitions. [2021-12-06 19:02:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:02:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:25,605 INFO L225 Difference]: With dead ends: 5061 [2021-12-06 19:02:25,606 INFO L226 Difference]: Without dead ends: 4476 [2021-12-06 19:02:25,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:02:25,609 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 678 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:25,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 1323 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:02:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2021-12-06 19:02:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4082. [2021-12-06 19:02:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 3243 states have (on average 1.3132901634289238) internal successors, (4259), 3302 states have internal predecessors, (4259), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2021-12-06 19:02:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5294 transitions. [2021-12-06 19:02:25,777 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5294 transitions. Word has length 69 [2021-12-06 19:02:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:25,777 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 5294 transitions. [2021-12-06 19:02:25,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5294 transitions. [2021-12-06 19:02:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:25,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:25,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:25,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 19:02:25,780 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2021-12-06 19:02:25,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369033824] [2021-12-06 19:02:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:25,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:25,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:25,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369033824] [2021-12-06 19:02:25,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369033824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:25,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:25,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:25,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309993162] [2021-12-06 19:02:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:25,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:25,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:25,843 INFO L87 Difference]: Start difference. First operand 4082 states and 5294 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:26,310 INFO L93 Difference]: Finished difference Result 5305 states and 7127 transitions. [2021-12-06 19:02:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:02:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:26,322 INFO L225 Difference]: With dead ends: 5305 [2021-12-06 19:02:26,322 INFO L226 Difference]: Without dead ends: 4313 [2021-12-06 19:02:26,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:26,325 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 531 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:26,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 832 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:02:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-12-06 19:02:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4082. [2021-12-06 19:02:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 3243 states have (on average 1.3105149552883133) internal successors, (4250), 3302 states have internal predecessors, (4250), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2021-12-06 19:02:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5285 transitions. [2021-12-06 19:02:26,516 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5285 transitions. Word has length 69 [2021-12-06 19:02:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:26,516 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 5285 transitions. [2021-12-06 19:02:26,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5285 transitions. [2021-12-06 19:02:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:26,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:26,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:26,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 19:02:26,519 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:26,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -175476102, now seen corresponding path program 1 times [2021-12-06 19:02:26,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:26,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285963538] [2021-12-06 19:02:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:26,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:26,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:26,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285963538] [2021-12-06 19:02:26,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285963538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:26,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:26,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:26,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278125573] [2021-12-06 19:02:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:26,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:26,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:26,586 INFO L87 Difference]: Start difference. First operand 4082 states and 5285 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:27,137 INFO L93 Difference]: Finished difference Result 5617 states and 7562 transitions. [2021-12-06 19:02:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:02:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:27,152 INFO L225 Difference]: With dead ends: 5617 [2021-12-06 19:02:27,152 INFO L226 Difference]: Without dead ends: 4626 [2021-12-06 19:02:27,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:02:27,155 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 365 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:27,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 1214 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:02:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2021-12-06 19:02:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4109. [2021-12-06 19:02:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 3270 states have (on average 1.3079510703363915) internal successors, (4277), 3329 states have internal predecessors, (4277), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2021-12-06 19:02:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 5312 transitions. [2021-12-06 19:02:27,323 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 5312 transitions. Word has length 69 [2021-12-06 19:02:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:27,324 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 5312 transitions. [2021-12-06 19:02:27,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 5312 transitions. [2021-12-06 19:02:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:02:27,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:27,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:27,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 19:02:27,326 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash 72670392, now seen corresponding path program 1 times [2021-12-06 19:02:27,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:27,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716216651] [2021-12-06 19:02:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:27,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:27,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:27,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716216651] [2021-12-06 19:02:27,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716216651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:27,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:27,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:27,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113189021] [2021-12-06 19:02:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:27,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:27,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:27,416 INFO L87 Difference]: Start difference. First operand 4109 states and 5312 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:28,380 INFO L93 Difference]: Finished difference Result 7573 states and 10510 transitions. [2021-12-06 19:02:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 19:02:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-06 19:02:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:28,394 INFO L225 Difference]: With dead ends: 7573 [2021-12-06 19:02:28,395 INFO L226 Difference]: Without dead ends: 6555 [2021-12-06 19:02:28,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-06 19:02:28,399 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 1356 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:28,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1381 Valid, 1175 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 19:02:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6555 states. [2021-12-06 19:02:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6555 to 5986. [2021-12-06 19:02:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5986 states, 4835 states have (on average 1.3445708376421923) internal successors, (6501), 4925 states have internal predecessors, (6501), 610 states have call successors, (610), 446 states have call predecessors, (610), 539 states have return successors, (908), 624 states have call predecessors, (908), 606 states have call successors, (908) [2021-12-06 19:02:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 8019 transitions. [2021-12-06 19:02:28,710 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 8019 transitions. Word has length 69 [2021-12-06 19:02:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:28,710 INFO L470 AbstractCegarLoop]: Abstraction has 5986 states and 8019 transitions. [2021-12-06 19:02:28,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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) [2021-12-06 19:02:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 8019 transitions. [2021-12-06 19:02:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 19:02:28,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:28,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:28,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 19:02:28,713 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash 867157537, now seen corresponding path program 1 times [2021-12-06 19:02:28,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:28,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53145085] [2021-12-06 19:02:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:28,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:28,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:28,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53145085] [2021-12-06 19:02:28,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53145085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:28,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:28,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:02:28,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136902743] [2021-12-06 19:02:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:28,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:02:28,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:28,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:02:28,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:02:28,759 INFO L87 Difference]: Start difference. First operand 5986 states and 8019 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2021-12-06 19:02:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:29,197 INFO L93 Difference]: Finished difference Result 9572 states and 12449 transitions. [2021-12-06 19:02:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:02:29,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2021-12-06 19:02:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:29,219 INFO L225 Difference]: With dead ends: 9572 [2021-12-06 19:02:29,219 INFO L226 Difference]: Without dead ends: 6502 [2021-12-06 19:02:29,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:29,228 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 720 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:29,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 693 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6502 states. [2021-12-06 19:02:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6502 to 6269. [2021-12-06 19:02:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6269 states, 5060 states have (on average 1.3377470355731225) internal successors, (6769), 5153 states have internal predecessors, (6769), 638 states have call successors, (638), 471 states have call predecessors, (638), 569 states have return successors, (942), 654 states have call predecessors, (942), 634 states have call successors, (942) [2021-12-06 19:02:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8349 transitions. [2021-12-06 19:02:29,547 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8349 transitions. Word has length 72 [2021-12-06 19:02:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:29,547 INFO L470 AbstractCegarLoop]: Abstraction has 6269 states and 8349 transitions. [2021-12-06 19:02:29,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2021-12-06 19:02:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8349 transitions. [2021-12-06 19:02:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 19:02:29,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:29,549 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:29,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 19:02:29,549 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 595856072, now seen corresponding path program 1 times [2021-12-06 19:02:29,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:29,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809670448] [2021-12-06 19:02:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:29,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:29,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:29,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809670448] [2021-12-06 19:02:29,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809670448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:29,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:29,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:29,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824013390] [2021-12-06 19:02:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:29,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:29,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:29,603 INFO L87 Difference]: Start difference. First operand 6269 states and 8349 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) [2021-12-06 19:02:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:30,167 INFO L93 Difference]: Finished difference Result 7323 states and 9616 transitions. [2021-12-06 19:02:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 19:02:30,168 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 [2021-12-06 19:02:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:30,184 INFO L225 Difference]: With dead ends: 7323 [2021-12-06 19:02:30,184 INFO L226 Difference]: Without dead ends: 7320 [2021-12-06 19:02:30,186 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:02:30,187 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 890 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:30,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [900 Valid, 817 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2021-12-06 19:02:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7026. [2021-12-06 19:02:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7026 states, 5638 states have (on average 1.3245831855267824) internal successors, (7468), 5738 states have internal predecessors, (7468), 721 states have call successors, (721), 543 states have call predecessors, (721), 665 states have return successors, (1070), 754 states have call predecessors, (1070), 718 states have call successors, (1070) [2021-12-06 19:02:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7026 states to 7026 states and 9259 transitions. [2021-12-06 19:02:30,544 INFO L78 Accepts]: Start accepts. Automaton has 7026 states and 9259 transitions. Word has length 73 [2021-12-06 19:02:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:30,544 INFO L470 AbstractCegarLoop]: Abstraction has 7026 states and 9259 transitions. [2021-12-06 19:02:30,544 INFO L471 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) [2021-12-06 19:02:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7026 states and 9259 transitions. [2021-12-06 19:02:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 19:02:30,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:30,546 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:30,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 19:02:30,546 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1290941259, now seen corresponding path program 1 times [2021-12-06 19:02:30,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:30,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818958270] [2021-12-06 19:02:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:30,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:30,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:30,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818958270] [2021-12-06 19:02:30,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818958270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:30,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646089622] [2021-12-06 19:02:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:30,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:30,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:30,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:02:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:30,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:02:30,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:30,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:02:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:31,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646089622] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:02:31,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:02:31,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-06 19:02:31,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46817609] [2021-12-06 19:02:31,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:02:31,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:02:31,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:31,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:02:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:02:31,155 INFO L87 Difference]: Start difference. First operand 7026 states and 9259 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) [2021-12-06 19:02:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:32,415 INFO L93 Difference]: Finished difference Result 11445 states and 14633 transitions. [2021-12-06 19:02:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 19:02:32,415 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 [2021-12-06 19:02:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:32,435 INFO L225 Difference]: With dead ends: 11445 [2021-12-06 19:02:32,435 INFO L226 Difference]: Without dead ends: 11442 [2021-12-06 19:02:32,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-06 19:02:32,439 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 1199 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:32,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1255 Valid, 1612 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 19:02:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2021-12-06 19:02:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 10585. [2021-12-06 19:02:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10585 states, 8423 states have (on average 1.294194467529384) internal successors, (10901), 8574 states have internal predecessors, (10901), 1091 states have call successors, (1091), 868 states have call predecessors, (1091), 1069 states have return successors, (1616), 1152 states have call predecessors, (1616), 1088 states have call successors, (1616) [2021-12-06 19:02:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 13608 transitions. [2021-12-06 19:02:33,013 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 13608 transitions. Word has length 74 [2021-12-06 19:02:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:33,013 INFO L470 AbstractCegarLoop]: Abstraction has 10585 states and 13608 transitions. [2021-12-06 19:02:33,013 INFO L471 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) [2021-12-06 19:02:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 13608 transitions. [2021-12-06 19:02:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-06 19:02:33,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:33,015 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:33,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:02:33,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:33,217 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash 372887048, now seen corresponding path program 2 times [2021-12-06 19:02:33,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:33,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749331511] [2021-12-06 19:02:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:33,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:02:33,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:33,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749331511] [2021-12-06 19:02:33,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749331511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:33,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:33,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:02:33,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771647230] [2021-12-06 19:02:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:33,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:02:33,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:02:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:02:33,271 INFO L87 Difference]: Start difference. First operand 10585 states and 13608 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) [2021-12-06 19:02:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:33,781 INFO L93 Difference]: Finished difference Result 13594 states and 17332 transitions. [2021-12-06 19:02:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:02:33,782 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 [2021-12-06 19:02:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:33,796 INFO L225 Difference]: With dead ends: 13594 [2021-12-06 19:02:33,796 INFO L226 Difference]: Without dead ends: 6796 [2021-12-06 19:02:33,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:02:33,808 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 522 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:33,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 908 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6796 states. [2021-12-06 19:02:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6796 to 5770. [2021-12-06 19:02:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 4674 states have (on average 1.331193838254172) internal successors, (6222), 4747 states have internal predecessors, (6222), 591 states have call successors, (591), 433 states have call predecessors, (591), 503 states have return successors, (842), 599 states have call predecessors, (842), 588 states have call successors, (842) [2021-12-06 19:02:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 7655 transitions. [2021-12-06 19:02:34,128 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 7655 transitions. Word has length 77 [2021-12-06 19:02:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:34,128 INFO L470 AbstractCegarLoop]: Abstraction has 5770 states and 7655 transitions. [2021-12-06 19:02:34,128 INFO L471 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) [2021-12-06 19:02:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 7655 transitions. [2021-12-06 19:02:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 19:02:34,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:34,131 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:34,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 19:02:34,131 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1502182211, now seen corresponding path program 1 times [2021-12-06 19:02:34,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:34,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832791388] [2021-12-06 19:02:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:34,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 19:02:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 19:02:34,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:34,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832791388] [2021-12-06 19:02:34,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832791388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:34,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:34,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:02:34,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004621609] [2021-12-06 19:02:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:34,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:02:34,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:02:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:34,193 INFO L87 Difference]: Start difference. First operand 5770 states and 7655 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) [2021-12-06 19:02:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:35,028 INFO L93 Difference]: Finished difference Result 11494 states and 14579 transitions. [2021-12-06 19:02:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 19:02:35,029 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 [2021-12-06 19:02:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:35,045 INFO L225 Difference]: With dead ends: 11494 [2021-12-06 19:02:35,045 INFO L226 Difference]: Without dead ends: 7698 [2021-12-06 19:02:35,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-06 19:02:35,053 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 711 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:35,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 1374 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:02:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7698 states. [2021-12-06 19:02:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7698 to 7467. [2021-12-06 19:02:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7467 states, 5968 states have (on average 1.2944034852546917) internal successors, (7725), 6078 states have internal predecessors, (7725), 775 states have call successors, (775), 591 states have call predecessors, (775), 722 states have return successors, (1163), 807 states have call predecessors, (1163), 772 states have call successors, (1163) [2021-12-06 19:02:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 9663 transitions. [2021-12-06 19:02:35,500 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 9663 transitions. Word has length 84 [2021-12-06 19:02:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:35,500 INFO L470 AbstractCegarLoop]: Abstraction has 7467 states and 9663 transitions. [2021-12-06 19:02:35,500 INFO L471 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) [2021-12-06 19:02:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 9663 transitions. [2021-12-06 19:02:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 19:02:35,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:35,503 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:35,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 19:02:35,503 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash 905485990, now seen corresponding path program 1 times [2021-12-06 19:02:35,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233564558] [2021-12-06 19:02:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:35,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:02:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:02:35,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:35,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233564558] [2021-12-06 19:02:35,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233564558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:35,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:35,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:02:35,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351906071] [2021-12-06 19:02:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:35,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:02:35,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:02:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:02:35,565 INFO L87 Difference]: Start difference. First operand 7467 states and 9663 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) [2021-12-06 19:02:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:36,364 INFO L93 Difference]: Finished difference Result 10346 states and 13147 transitions. [2021-12-06 19:02:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 19:02:36,364 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 [2021-12-06 19:02:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:36,376 INFO L225 Difference]: With dead ends: 10346 [2021-12-06 19:02:36,376 INFO L226 Difference]: Without dead ends: 6532 [2021-12-06 19:02:36,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-06 19:02:36,384 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1148 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:36,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1177 Valid, 1225 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:02:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2021-12-06 19:02:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6155. [2021-12-06 19:02:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 4940 states have (on average 1.305263157894737) internal successors, (6448), 5033 states have internal predecessors, (6448), 633 states have call successors, (633), 467 states have call predecessors, (633), 580 states have return successors, (928), 664 states have call predecessors, (928), 630 states have call successors, (928) [2021-12-06 19:02:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 8009 transitions. [2021-12-06 19:02:36,712 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 8009 transitions. Word has length 93 [2021-12-06 19:02:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:36,713 INFO L470 AbstractCegarLoop]: Abstraction has 6155 states and 8009 transitions. [2021-12-06 19:02:36,713 INFO L471 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) [2021-12-06 19:02:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 8009 transitions. [2021-12-06 19:02:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-06 19:02:36,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:36,717 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-06 19:02:36,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 19:02:36,717 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash -33791116, now seen corresponding path program 1 times [2021-12-06 19:02:36,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:36,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966260917] [2021-12-06 19:02:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:36,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:02:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 19:02:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 19:02:36,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:36,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966260917] [2021-12-06 19:02:36,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966260917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:36,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131180798] [2021-12-06 19:02:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:36,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:36,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:36,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:02:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:36,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:02:36,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:02:36,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:36,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131180798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:36,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:36,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:02:36,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548056924] [2021-12-06 19:02:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:36,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:36,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:36,935 INFO L87 Difference]: Start difference. First operand 6155 states and 8009 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2021-12-06 19:02:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:37,293 INFO L93 Difference]: Finished difference Result 9277 states and 12621 transitions. [2021-12-06 19:02:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 111 [2021-12-06 19:02:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:37,304 INFO L225 Difference]: With dead ends: 9277 [2021-12-06 19:02:37,304 INFO L226 Difference]: Without dead ends: 6680 [2021-12-06 19:02:37,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:37,310 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 142 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:37,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2021-12-06 19:02:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6680. [2021-12-06 19:02:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6680 states, 5382 states have (on average 1.3138238573021181) internal successors, (7071), 5479 states have internal predecessors, (7071), 682 states have call successors, (682), 497 states have call predecessors, (682), 614 states have return successors, (1006), 713 states have call predecessors, (1006), 679 states have call successors, (1006) [2021-12-06 19:02:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 8759 transitions. [2021-12-06 19:02:37,657 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 8759 transitions. Word has length 111 [2021-12-06 19:02:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:37,657 INFO L470 AbstractCegarLoop]: Abstraction has 6680 states and 8759 transitions. [2021-12-06 19:02:37,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2021-12-06 19:02:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 8759 transitions. [2021-12-06 19:02:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-06 19:02:37,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:37,664 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:02:37,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:02:37,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:37,866 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -878802759, now seen corresponding path program 1 times [2021-12-06 19:02:37,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188097630] [2021-12-06 19:02:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:37,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 19:02:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:02:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 19:02:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 19:02:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 19:02:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 19:02:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-06 19:02:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 19:02:37,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188097630] [2021-12-06 19:02:37,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188097630] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85889751] [2021-12-06 19:02:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:37,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:37,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:37,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:02:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:38,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:02:38,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 19:02:38,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:38,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85889751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:38,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:38,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-06 19:02:38,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859792957] [2021-12-06 19:02:38,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:38,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:02:38,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:02:38,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:02:38,206 INFO L87 Difference]: Start difference. First operand 6680 states and 8759 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) [2021-12-06 19:02:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:38,502 INFO L93 Difference]: Finished difference Result 8359 states and 10772 transitions. [2021-12-06 19:02:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:02:38,503 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 [2021-12-06 19:02:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:38,511 INFO L225 Difference]: With dead ends: 8359 [2021-12-06 19:02:38,512 INFO L226 Difference]: Without dead ends: 5122 [2021-12-06 19:02:38,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:02:38,517 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 34 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:38,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1578 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2021-12-06 19:02:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 4999. [2021-12-06 19:02:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4999 states, 4143 states have (on average 1.3519188993482982) internal successors, (5601), 4201 states have internal predecessors, (5601), 474 states have call successors, (474), 314 states have call predecessors, (474), 380 states have return successors, (712), 491 states have call predecessors, (712), 471 states have call successors, (712) [2021-12-06 19:02:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 6787 transitions. [2021-12-06 19:02:38,762 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 6787 transitions. Word has length 145 [2021-12-06 19:02:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:38,762 INFO L470 AbstractCegarLoop]: Abstraction has 4999 states and 6787 transitions. [2021-12-06 19:02:38,762 INFO L471 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) [2021-12-06 19:02:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 6787 transitions. [2021-12-06 19:02:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-06 19:02:38,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:38,767 INFO L514 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:38,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:02:38,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 19:02:38,969 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1647944136, now seen corresponding path program 1 times [2021-12-06 19:02:38,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:38,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935463546] [2021-12-06 19:02:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:38,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:02:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 19:02:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 19:02:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:02:39,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935463546] [2021-12-06 19:02:39,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935463546] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715782466] [2021-12-06 19:02:39,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:39,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:39,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:39,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:02:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:39,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:02:39,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:02:39,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:39,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715782466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:39,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:39,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 19:02:39,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908473502] [2021-12-06 19:02:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:39,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:39,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:39,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:39,237 INFO L87 Difference]: Start difference. First operand 4999 states and 6787 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:02:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:39,606 INFO L93 Difference]: Finished difference Result 11709 states and 16632 transitions. [2021-12-06 19:02:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:39,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2021-12-06 19:02:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:39,621 INFO L225 Difference]: With dead ends: 11709 [2021-12-06 19:02:39,621 INFO L226 Difference]: Without dead ends: 8289 [2021-12-06 19:02:39,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:39,632 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 235 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 500 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 [2021-12-06 19:02:39,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 500 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2021-12-06 19:02:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 8219. [2021-12-06 19:02:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 6837 states have (on average 1.3791136463361122) internal successors, (9429), 6938 states have internal predecessors, (9429), 778 states have call successors, (778), 508 states have call predecessors, (778), 602 states have return successors, (1176), 780 states have call predecessors, (1176), 775 states have call successors, (1176) [2021-12-06 19:02:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 11383 transitions. [2021-12-06 19:02:40,053 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 11383 transitions. Word has length 143 [2021-12-06 19:02:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:40,053 INFO L470 AbstractCegarLoop]: Abstraction has 8219 states and 11383 transitions. [2021-12-06 19:02:40,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:02:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 11383 transitions. [2021-12-06 19:02:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-06 19:02:40,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:40,062 INFO L514 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:40,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:02:40,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:40,264 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1613614096, now seen corresponding path program 1 times [2021-12-06 19:02:40,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:40,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642689738] [2021-12-06 19:02:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:40,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:02:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 19:02:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 19:02:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:02:40,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:40,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642689738] [2021-12-06 19:02:40,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642689738] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:40,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080778893] [2021-12-06 19:02:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:40,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:40,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:40,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:40,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:02:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:40,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:02:40,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:02:40,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:40,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080778893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:40,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:40,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 19:02:40,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592953708] [2021-12-06 19:02:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:40,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:40,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:40,537 INFO L87 Difference]: Start difference. First operand 8219 states and 11383 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:02:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:41,028 INFO L93 Difference]: Finished difference Result 15479 states and 22009 transitions. [2021-12-06 19:02:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:41,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2021-12-06 19:02:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:41,047 INFO L225 Difference]: With dead ends: 15479 [2021-12-06 19:02:41,048 INFO L226 Difference]: Without dead ends: 11291 [2021-12-06 19:02:41,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:41,059 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 236 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 521 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 [2021-12-06 19:02:41,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 521 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2021-12-06 19:02:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 11191. [2021-12-06 19:02:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11191 states, 9344 states have (on average 1.3930864726027397) internal successors, (13017), 9479 states have internal predecessors, (13017), 1046 states have call successors, (1046), 681 states have call predecessors, (1046), 799 states have return successors, (1557), 1038 states have call predecessors, (1557), 1043 states have call successors, (1557) [2021-12-06 19:02:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11191 states to 11191 states and 15620 transitions. [2021-12-06 19:02:41,618 INFO L78 Accepts]: Start accepts. Automaton has 11191 states and 15620 transitions. Word has length 143 [2021-12-06 19:02:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:41,618 INFO L470 AbstractCegarLoop]: Abstraction has 11191 states and 15620 transitions. [2021-12-06 19:02:41,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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) [2021-12-06 19:02:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11191 states and 15620 transitions. [2021-12-06 19:02:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 19:02:41,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:41,629 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:41,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:02:41,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 19:02:41,831 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 50370099, now seen corresponding path program 1 times [2021-12-06 19:02:41,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:41,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264253740] [2021-12-06 19:02:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:41,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 19:02:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:02:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-06 19:02:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 19:02:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 19:02:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 19:02:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 19:02:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 19:02:41,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:41,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264253740] [2021-12-06 19:02:41,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264253740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:41,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:41,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:02:41,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291288150] [2021-12-06 19:02:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:41,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:02:41,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:02:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:02:41,914 INFO L87 Difference]: Start difference. First operand 11191 states and 15620 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 19:02:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:42,707 INFO L93 Difference]: Finished difference Result 12474 states and 17140 transitions. [2021-12-06 19:02:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:02:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2021-12-06 19:02:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:42,730 INFO L225 Difference]: With dead ends: 12474 [2021-12-06 19:02:42,730 INFO L226 Difference]: Without dead ends: 11084 [2021-12-06 19:02:42,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:42,736 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 280 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:42,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 1184 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2021-12-06 19:02:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 10938. [2021-12-06 19:02:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10938 states, 9142 states have (on average 1.3987092539925619) internal successors, (12787), 9277 states have internal predecessors, (12787), 1021 states have call successors, (1021), 660 states have call predecessors, (1021), 773 states have return successors, (1519), 1008 states have call predecessors, (1519), 1018 states have call successors, (1519) [2021-12-06 19:02:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10938 states to 10938 states and 15327 transitions. [2021-12-06 19:02:43,297 INFO L78 Accepts]: Start accepts. Automaton has 10938 states and 15327 transitions. Word has length 159 [2021-12-06 19:02:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:43,297 INFO L470 AbstractCegarLoop]: Abstraction has 10938 states and 15327 transitions. [2021-12-06 19:02:43,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 19:02:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10938 states and 15327 transitions. [2021-12-06 19:02:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 19:02:43,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:43,308 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:43,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 19:02:43,309 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2115413199, now seen corresponding path program 1 times [2021-12-06 19:02:43,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:43,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959299278] [2021-12-06 19:02:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:43,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:02:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 19:02:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 19:02:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 19:02:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:02:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 19:02:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 19:02:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 19:02:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:02:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:02:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 19:02:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-06 19:02:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 19:02:43,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:43,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959299278] [2021-12-06 19:02:43,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959299278] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:43,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328067150] [2021-12-06 19:02:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:43,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:43,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:43,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:02:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:43,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 19:02:43,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-06 19:02:43,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:43,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328067150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:43,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:43,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2021-12-06 19:02:43,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962331986] [2021-12-06 19:02:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:43,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:02:43,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:02:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:02:43,628 INFO L87 Difference]: Start difference. First operand 10938 states and 15327 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 19:02:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:44,268 INFO L93 Difference]: Finished difference Result 13264 states and 18135 transitions. [2021-12-06 19:02:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:02:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2021-12-06 19:02:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:44,312 INFO L225 Difference]: With dead ends: 13264 [2021-12-06 19:02:44,312 INFO L226 Difference]: Without dead ends: 11854 [2021-12-06 19:02:44,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:02:44,317 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 177 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:44,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 634 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:02:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2021-12-06 19:02:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11812. [2021-12-06 19:02:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11812 states, 9873 states have (on average 1.37992504811101) internal successors, (13624), 10012 states have internal predecessors, (13624), 1091 states have call successors, (1091), 711 states have call predecessors, (1091), 846 states have return successors, (1630), 1096 states have call predecessors, (1630), 1088 states have call successors, (1630) [2021-12-06 19:02:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11812 states to 11812 states and 16345 transitions. [2021-12-06 19:02:44,887 INFO L78 Accepts]: Start accepts. Automaton has 11812 states and 16345 transitions. Word has length 162 [2021-12-06 19:02:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:44,887 INFO L470 AbstractCegarLoop]: Abstraction has 11812 states and 16345 transitions. [2021-12-06 19:02:44,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 19:02:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11812 states and 16345 transitions. [2021-12-06 19:02:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:02:44,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:44,899 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:02:44,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-06 19:02:45,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 19:02:45,101 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717299, now seen corresponding path program 1 times [2021-12-06 19:02:45,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:45,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415120879] [2021-12-06 19:02:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:45,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:02:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:02:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 19:02:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:02:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-06 19:02:45,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:45,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415120879] [2021-12-06 19:02:45,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415120879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:45,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608417845] [2021-12-06 19:02:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:45,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:45,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:45,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:02:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:45,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:02:45,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-06 19:02:45,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:45,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608417845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:45,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:45,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:02:45,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513322042] [2021-12-06 19:02:45,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:45,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:45,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:45,386 INFO L87 Difference]: Start difference. First operand 11812 states and 16345 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2021-12-06 19:02:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:46,027 INFO L93 Difference]: Finished difference Result 21659 states and 30562 transitions. [2021-12-06 19:02:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 160 [2021-12-06 19:02:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:46,053 INFO L225 Difference]: With dead ends: 21659 [2021-12-06 19:02:46,053 INFO L226 Difference]: Without dead ends: 12746 [2021-12-06 19:02:46,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:46,070 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 298 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 358 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 [2021-12-06 19:02:46,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12746 states. [2021-12-06 19:02:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12746 to 12363. [2021-12-06 19:02:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12363 states, 10418 states have (on average 1.3288539066999423) internal successors, (13844), 10537 states have internal predecessors, (13844), 1059 states have call successors, (1059), 752 states have call predecessors, (1059), 884 states have return successors, (1508), 1077 states have call predecessors, (1508), 1056 states have call successors, (1508) [2021-12-06 19:02:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12363 states to 12363 states and 16411 transitions. [2021-12-06 19:02:46,843 INFO L78 Accepts]: Start accepts. Automaton has 12363 states and 16411 transitions. Word has length 160 [2021-12-06 19:02:46,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:46,844 INFO L470 AbstractCegarLoop]: Abstraction has 12363 states and 16411 transitions. [2021-12-06 19:02:46,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2021-12-06 19:02:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12363 states and 16411 transitions. [2021-12-06 19:02:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:02:46,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:46,854 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:02:46,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:02:47,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 19:02:47,056 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:47,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2001388946, now seen corresponding path program 1 times [2021-12-06 19:02:47,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:47,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281749747] [2021-12-06 19:02:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:47,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:02:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:02:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 19:02:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:02:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-06 19:02:47,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281749747] [2021-12-06 19:02:47,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281749747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476300513] [2021-12-06 19:02:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:47,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:47,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:47,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:02:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:47,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:02:47,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:02:47,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:47,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476300513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:47,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:47,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:02:47,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852256270] [2021-12-06 19:02:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:47,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:47,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:47,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:47,332 INFO L87 Difference]: Start difference. First operand 12363 states and 16411 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:02:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:47,895 INFO L93 Difference]: Finished difference Result 19757 states and 26723 transitions. [2021-12-06 19:02:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-06 19:02:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:47,915 INFO L225 Difference]: With dead ends: 19757 [2021-12-06 19:02:47,915 INFO L226 Difference]: Without dead ends: 10393 [2021-12-06 19:02:47,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:47,930 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 254 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:47,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 368 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2021-12-06 19:02:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 10257. [2021-12-06 19:02:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10257 states, 8633 states have (on average 1.2994324105177806) internal successors, (11218), 8700 states have internal predecessors, (11218), 879 states have call successors, (879), 647 states have call predecessors, (879), 743 states have return successors, (1269), 911 states have call predecessors, (1269), 876 states have call successors, (1269) [2021-12-06 19:02:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10257 states to 10257 states and 13366 transitions. [2021-12-06 19:02:48,521 INFO L78 Accepts]: Start accepts. Automaton has 10257 states and 13366 transitions. Word has length 160 [2021-12-06 19:02:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:48,521 INFO L470 AbstractCegarLoop]: Abstraction has 10257 states and 13366 transitions. [2021-12-06 19:02:48,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:02:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10257 states and 13366 transitions. [2021-12-06 19:02:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:02:48,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:48,526 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2021-12-06 19:02:48,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-06 19:02:48,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:48,728 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash 453524583, now seen corresponding path program 1 times [2021-12-06 19:02:48,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:48,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996721804] [2021-12-06 19:02:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:48,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:02:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:02:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:02:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:02:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-06 19:02:48,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996721804] [2021-12-06 19:02:48,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996721804] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111567204] [2021-12-06 19:02:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:48,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:48,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:48,807 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:48,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:02:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:48,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:02:48,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-06 19:02:48,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:48,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111567204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:48,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:48,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:02:48,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121342881] [2021-12-06 19:02:48,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:48,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:48,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:48,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:48,958 INFO L87 Difference]: Start difference. First operand 10257 states and 13366 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2021-12-06 19:02:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:49,515 INFO L93 Difference]: Finished difference Result 18231 states and 24109 transitions. [2021-12-06 19:02:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 160 [2021-12-06 19:02:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:49,531 INFO L225 Difference]: With dead ends: 18231 [2021-12-06 19:02:49,531 INFO L226 Difference]: Without dead ends: 10175 [2021-12-06 19:02:49,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:49,541 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 280 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:49,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 506 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10175 states. [2021-12-06 19:02:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10175 to 10175. [2021-12-06 19:02:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10175 states, 8551 states have (on average 1.2831247807274002) internal successors, (10972), 8618 states have internal predecessors, (10972), 879 states have call successors, (879), 647 states have call predecessors, (879), 743 states have return successors, (1269), 911 states have call predecessors, (1269), 876 states have call successors, (1269) [2021-12-06 19:02:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 13120 transitions. [2021-12-06 19:02:50,107 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 13120 transitions. Word has length 160 [2021-12-06 19:02:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:50,107 INFO L470 AbstractCegarLoop]: Abstraction has 10175 states and 13120 transitions. [2021-12-06 19:02:50,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2021-12-06 19:02:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 13120 transitions. [2021-12-06 19:02:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:02:50,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:50,112 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:02:50,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:02:50,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-06 19:02:50,313 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882321, now seen corresponding path program 1 times [2021-12-06 19:02:50,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:50,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410374119] [2021-12-06 19:02:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:50,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:02:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:02:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:02:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:02:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-06 19:02:50,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410374119] [2021-12-06 19:02:50,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410374119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10637850] [2021-12-06 19:02:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:50,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:50,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:50,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:50,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:02:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:50,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:02:50,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:02:50,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:50,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10637850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:50,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:50,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:02:50,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782750833] [2021-12-06 19:02:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:50,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:50,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:50,573 INFO L87 Difference]: Start difference. First operand 10175 states and 13120 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:02:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:51,588 INFO L93 Difference]: Finished difference Result 25677 states and 33927 transitions. [2021-12-06 19:02:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-06 19:02:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:51,627 INFO L225 Difference]: With dead ends: 25677 [2021-12-06 19:02:51,627 INFO L226 Difference]: Without dead ends: 17703 [2021-12-06 19:02:51,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:51,643 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 152 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:51,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 781 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17703 states. [2021-12-06 19:02:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17703 to 17699. [2021-12-06 19:02:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17699 states, 14931 states have (on average 1.288594199986605) internal successors, (19240), 15047 states have internal predecessors, (19240), 1513 states have call successors, (1513), 1119 states have call predecessors, (1513), 1253 states have return successors, (2502), 1536 states have call predecessors, (2502), 1510 states have call successors, (2502) [2021-12-06 19:02:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17699 states to 17699 states and 23255 transitions. [2021-12-06 19:02:52,682 INFO L78 Accepts]: Start accepts. Automaton has 17699 states and 23255 transitions. Word has length 161 [2021-12-06 19:02:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:52,682 INFO L470 AbstractCegarLoop]: Abstraction has 17699 states and 23255 transitions. [2021-12-06 19:02:52,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:02:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 17699 states and 23255 transitions. [2021-12-06 19:02:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:02:52,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:52,688 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:02:52,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 19:02:52,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:52,889 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash -831857108, now seen corresponding path program 1 times [2021-12-06 19:02:52,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:52,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651531330] [2021-12-06 19:02:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:52,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:02:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:02:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:02:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:02:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-06 19:02:52,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:52,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651531330] [2021-12-06 19:02:52,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651531330] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:02:52,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737381393] [2021-12-06 19:02:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:52,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:02:52,959 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:02:52,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:02:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:53,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:02:53,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:02:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-06 19:02:53,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:02:53,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737381393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:53,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:02:53,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:02:53,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944138471] [2021-12-06 19:02:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:53,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:02:53,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:02:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:53,129 INFO L87 Difference]: Start difference. First operand 17699 states and 23255 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:02:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:54,853 INFO L93 Difference]: Finished difference Result 48142 states and 64938 transitions. [2021-12-06 19:02:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:02:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2021-12-06 19:02:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:54,926 INFO L225 Difference]: With dead ends: 48142 [2021-12-06 19:02:54,926 INFO L226 Difference]: Without dead ends: 32648 [2021-12-06 19:02:54,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:02:54,952 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 279 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:54,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 533 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:02:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32648 states. [2021-12-06 19:02:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32648 to 32386. [2021-12-06 19:02:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32386 states, 27400 states have (on average 1.2874452554744527) internal successors, (35276), 27614 states have internal predecessors, (35276), 2735 states have call successors, (2735), 2040 states have call predecessors, (2735), 2249 states have return successors, (5701), 2739 states have call predecessors, (5701), 2732 states have call successors, (5701) [2021-12-06 19:02:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32386 states to 32386 states and 43712 transitions. [2021-12-06 19:02:57,049 INFO L78 Accepts]: Start accepts. Automaton has 32386 states and 43712 transitions. Word has length 161 [2021-12-06 19:02:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:02:57,050 INFO L470 AbstractCegarLoop]: Abstraction has 32386 states and 43712 transitions. [2021-12-06 19:02:57,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:02:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32386 states and 43712 transitions. [2021-12-06 19:02:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:02:57,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:02:57,061 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-12-06 19:02:57,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-06 19:02:57,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:02:57,262 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:02:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:02:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 60308522, now seen corresponding path program 1 times [2021-12-06 19:02:57,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:02:57,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160767643] [2021-12-06 19:02:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:02:57,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:02:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:02:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:02:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:02:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:02:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:02:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:02:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:02:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:02:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:02:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:02:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:02:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 19:02:57,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:02:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160767643] [2021-12-06 19:02:57,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160767643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:02:57,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:02:57,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:02:57,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034833652] [2021-12-06 19:02:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:02:57,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:02:57,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:02:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:02:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:02:57,319 INFO L87 Difference]: Start difference. First operand 32386 states and 43712 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:02:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:02:59,263 INFO L93 Difference]: Finished difference Result 60240 states and 81614 transitions. [2021-12-06 19:02:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:02:59,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-06 19:02:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:02:59,328 INFO L225 Difference]: With dead ends: 60240 [2021-12-06 19:02:59,328 INFO L226 Difference]: Without dead ends: 30057 [2021-12-06 19:02:59,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:02:59,364 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 418 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:02:59,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 639 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:02:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30057 states. [2021-12-06 19:03:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30057 to 27447. [2021-12-06 19:03:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27447 states, 23188 states have (on average 1.28536311885458) internal successors, (29805), 23625 states have internal predecessors, (29805), 2121 states have call successors, (2121), 1577 states have call predecessors, (2121), 2136 states have return successors, (4984), 2248 states have call predecessors, (4984), 2118 states have call successors, (4984) [2021-12-06 19:03:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27447 states to 27447 states and 36910 transitions. [2021-12-06 19:03:01,125 INFO L78 Accepts]: Start accepts. Automaton has 27447 states and 36910 transitions. Word has length 161 [2021-12-06 19:03:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:01,126 INFO L470 AbstractCegarLoop]: Abstraction has 27447 states and 36910 transitions. [2021-12-06 19:03:01,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:03:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27447 states and 36910 transitions. [2021-12-06 19:03:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:03:01,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:01,135 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2021-12-06 19:03:01,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-06 19:03:01,135 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash -81101080, now seen corresponding path program 1 times [2021-12-06 19:03:01,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:01,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781397032] [2021-12-06 19:03:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:01,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:03:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:03:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 19:03:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:03:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:03:01,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781397032] [2021-12-06 19:03:01,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781397032] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196962452] [2021-12-06 19:03:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:01,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:01,196 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:01,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 19:03:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:01,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:03:01,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:03:01,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:01,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196962452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:01,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:01,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:03:01,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732881495] [2021-12-06 19:03:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:01,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:03:01,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:03:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:03:01,376 INFO L87 Difference]: Start difference. First operand 27447 states and 36910 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:03:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:03,184 INFO L93 Difference]: Finished difference Result 42925 states and 60200 transitions. [2021-12-06 19:03:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:03:03,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-06 19:03:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:03,251 INFO L225 Difference]: With dead ends: 42925 [2021-12-06 19:03:03,251 INFO L226 Difference]: Without dead ends: 27499 [2021-12-06 19:03:03,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:03:03,285 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 139 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 732 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 [2021-12-06 19:03:03,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 732 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:03:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27499 states. [2021-12-06 19:03:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27499 to 27423. [2021-12-06 19:03:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27423 states, 23164 states have (on average 1.2650233120359178) internal successors, (29303), 23601 states have internal predecessors, (29303), 2121 states have call successors, (2121), 1577 states have call predecessors, (2121), 2136 states have return successors, (4984), 2248 states have call predecessors, (4984), 2118 states have call successors, (4984) [2021-12-06 19:03:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27423 states to 27423 states and 36408 transitions. [2021-12-06 19:03:05,037 INFO L78 Accepts]: Start accepts. Automaton has 27423 states and 36408 transitions. Word has length 163 [2021-12-06 19:03:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:05,037 INFO L470 AbstractCegarLoop]: Abstraction has 27423 states and 36408 transitions. [2021-12-06 19:03:05,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:03:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27423 states and 36408 transitions. [2021-12-06 19:03:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:03:05,047 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:05,047 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:03:05,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-06 19:03:05,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 19:03:05,248 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -929152312, now seen corresponding path program 1 times [2021-12-06 19:03:05,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:05,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695002584] [2021-12-06 19:03:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:05,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:03:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:03:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 19:03:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:03:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:03:05,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695002584] [2021-12-06 19:03:05,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695002584] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065349103] [2021-12-06 19:03:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:05,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:05,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:05,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 19:03:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:05,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:03:05,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:03:05,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:05,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065349103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:05,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:05,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:03:05,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733148244] [2021-12-06 19:03:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:05,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:03:05,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:03:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:03:05,504 INFO L87 Difference]: Start difference. First operand 27423 states and 36408 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:03:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:07,324 INFO L93 Difference]: Finished difference Result 54547 states and 74486 transitions. [2021-12-06 19:03:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:03:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2021-12-06 19:03:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:07,387 INFO L225 Difference]: With dead ends: 54547 [2021-12-06 19:03:07,387 INFO L226 Difference]: Without dead ends: 29329 [2021-12-06 19:03:07,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:03:07,422 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 267 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 346 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 [2021-12-06 19:03:07,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:03:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29329 states. [2021-12-06 19:03:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29329 to 26433. [2021-12-06 19:03:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26433 states, 22478 states have (on average 1.2282676394697036) internal successors, (27609), 22913 states have internal predecessors, (27609), 1921 states have call successors, (1921), 1481 states have call predecessors, (1921), 2032 states have return successors, (4144), 2042 states have call predecessors, (4144), 1918 states have call successors, (4144) [2021-12-06 19:03:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26433 states to 26433 states and 33674 transitions. [2021-12-06 19:03:09,280 INFO L78 Accepts]: Start accepts. Automaton has 26433 states and 33674 transitions. Word has length 163 [2021-12-06 19:03:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:09,280 INFO L470 AbstractCegarLoop]: Abstraction has 26433 states and 33674 transitions. [2021-12-06 19:03:09,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:03:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26433 states and 33674 transitions. [2021-12-06 19:03:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:03:09,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:09,294 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:03:09,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 19:03:09,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-06 19:03:09,495 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 282552368, now seen corresponding path program 1 times [2021-12-06 19:03:09,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:09,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262215550] [2021-12-06 19:03:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:09,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:03:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:03:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:03:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:03:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:03:09,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:09,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262215550] [2021-12-06 19:03:09,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262215550] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503716448] [2021-12-06 19:03:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:09,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:09,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:09,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 19:03:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:09,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:03:09,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 19:03:09,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:09,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503716448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:09,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:09,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 19:03:09,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640963109] [2021-12-06 19:03:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:09,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:03:09,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:03:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:03:09,788 INFO L87 Difference]: Start difference. First operand 26433 states and 33674 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:03:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:11,382 INFO L93 Difference]: Finished difference Result 40445 states and 52443 transitions. [2021-12-06 19:03:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:03:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2021-12-06 19:03:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:11,431 INFO L225 Difference]: With dead ends: 40445 [2021-12-06 19:03:11,431 INFO L226 Difference]: Without dead ends: 22739 [2021-12-06 19:03:11,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:03:11,461 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 357 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:03:11,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 577 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:03:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22739 states. [2021-12-06 19:03:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22739 to 19551. [2021-12-06 19:03:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19551 states, 16633 states have (on average 1.2059760716647627) internal successors, (20059), 16934 states have internal predecessors, (20059), 1429 states have call successors, (1429), 1097 states have call predecessors, (1429), 1487 states have return successors, (3040), 1521 states have call predecessors, (3040), 1426 states have call successors, (3040) [2021-12-06 19:03:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19551 states to 19551 states and 24528 transitions. [2021-12-06 19:03:12,878 INFO L78 Accepts]: Start accepts. Automaton has 19551 states and 24528 transitions. Word has length 165 [2021-12-06 19:03:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:12,878 INFO L470 AbstractCegarLoop]: Abstraction has 19551 states and 24528 transitions. [2021-12-06 19:03:12,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:03:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19551 states and 24528 transitions. [2021-12-06 19:03:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:03:12,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:12,884 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:03:12,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 19:03:13,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-06 19:03:13,086 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 770599474, now seen corresponding path program 1 times [2021-12-06 19:03:13,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:13,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207992848] [2021-12-06 19:03:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:13,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:03:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:03:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:03:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:03:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:03:13,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207992848] [2021-12-06 19:03:13,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207992848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680811053] [2021-12-06 19:03:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:13,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:13,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:13,177 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:13,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 19:03:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:13,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:03:13,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 19:03:13,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:13,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680811053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:13,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:13,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 19:03:13,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456060145] [2021-12-06 19:03:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:13,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:03:13,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:03:13,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:03:13,355 INFO L87 Difference]: Start difference. First operand 19551 states and 24528 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:03:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:14,805 INFO L93 Difference]: Finished difference Result 36889 states and 46929 transitions. [2021-12-06 19:03:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:03:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2021-12-06 19:03:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:14,843 INFO L225 Difference]: With dead ends: 36889 [2021-12-06 19:03:14,844 INFO L226 Difference]: Without dead ends: 19539 [2021-12-06 19:03:14,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:03:14,868 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 351 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:03:14,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 570 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:03:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19539 states. [2021-12-06 19:03:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19539 to 19539. [2021-12-06 19:03:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19539 states, 16621 states have (on average 1.1773659827928524) internal successors, (19569), 16922 states have internal predecessors, (19569), 1429 states have call successors, (1429), 1097 states have call predecessors, (1429), 1487 states have return successors, (3040), 1521 states have call predecessors, (3040), 1426 states have call successors, (3040) [2021-12-06 19:03:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19539 states to 19539 states and 24038 transitions. [2021-12-06 19:03:16,271 INFO L78 Accepts]: Start accepts. Automaton has 19539 states and 24038 transitions. Word has length 165 [2021-12-06 19:03:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:16,271 INFO L470 AbstractCegarLoop]: Abstraction has 19539 states and 24038 transitions. [2021-12-06 19:03:16,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-12-06 19:03:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19539 states and 24038 transitions. [2021-12-06 19:03:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:03:16,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:16,276 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:03:16,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 19:03:16,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-06 19:03:16,477 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash -322035728, now seen corresponding path program 1 times [2021-12-06 19:03:16,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297835584] [2021-12-06 19:03:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:16,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:03:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:03:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:03:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:03:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:03:16,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:16,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297835584] [2021-12-06 19:03:16,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297835584] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:16,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502261022] [2021-12-06 19:03:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:16,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:16,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:16,547 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:16,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 19:03:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:03:16,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:03:16,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:16,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502261022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:16,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:16,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:03:16,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120648582] [2021-12-06 19:03:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:16,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:03:16,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:03:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:03:16,715 INFO L87 Difference]: Start difference. First operand 19539 states and 24038 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2021-12-06 19:03:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:18,036 INFO L93 Difference]: Finished difference Result 36553 states and 46030 transitions. [2021-12-06 19:03:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:03:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 165 [2021-12-06 19:03:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:18,076 INFO L225 Difference]: With dead ends: 36553 [2021-12-06 19:03:18,076 INFO L226 Difference]: Without dead ends: 19217 [2021-12-06 19:03:18,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:03:18,106 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 49 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1242 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 [2021-12-06 19:03:18,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1242 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:03:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2021-12-06 19:03:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 18823. [2021-12-06 19:03:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18823 states, 15928 states have (on average 1.1585886489201407) internal successors, (18454), 16213 states have internal predecessors, (18454), 1429 states have call successors, (1429), 1097 states have call predecessors, (1429), 1464 states have return successors, (2807), 1514 states have call predecessors, (2807), 1426 states have call successors, (2807) [2021-12-06 19:03:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18823 states to 18823 states and 22690 transitions. [2021-12-06 19:03:19,496 INFO L78 Accepts]: Start accepts. Automaton has 18823 states and 22690 transitions. Word has length 165 [2021-12-06 19:03:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:19,496 INFO L470 AbstractCegarLoop]: Abstraction has 18823 states and 22690 transitions. [2021-12-06 19:03:19,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2021-12-06 19:03:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18823 states and 22690 transitions. [2021-12-06 19:03:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:03:19,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:19,501 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 19:03:19,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-06 19:03:19,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:19,703 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -490424150, now seen corresponding path program 1 times [2021-12-06 19:03:19,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:19,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371504299] [2021-12-06 19:03:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:19,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:03:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:03:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:03:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:03:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-06 19:03:19,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371504299] [2021-12-06 19:03:19,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371504299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935415750] [2021-12-06 19:03:19,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:19,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:19,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:19,790 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:19,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 19:03:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:19,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:03:19,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 19:03:19,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:19,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935415750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:19,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:19,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:03:19,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202217371] [2021-12-06 19:03:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:19,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:03:19,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:03:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:03:19,963 INFO L87 Difference]: Start difference. First operand 18823 states and 22690 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2021-12-06 19:03:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:21,167 INFO L93 Difference]: Finished difference Result 29841 states and 36360 transitions. [2021-12-06 19:03:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:03:21,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 165 [2021-12-06 19:03:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:21,196 INFO L225 Difference]: With dead ends: 29841 [2021-12-06 19:03:21,196 INFO L226 Difference]: Without dead ends: 16971 [2021-12-06 19:03:21,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:03:21,213 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 10 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1227 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 [2021-12-06 19:03:21,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1227 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:03:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16971 states. [2021-12-06 19:03:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16971 to 16927. [2021-12-06 19:03:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16927 states, 14447 states have (on average 1.1407904755312521) internal successors, (16481), 14592 states have internal predecessors, (16481), 1289 states have call successors, (1289), 994 states have call predecessors, (1289), 1189 states have return successors, (1975), 1342 states have call predecessors, (1975), 1286 states have call successors, (1975) [2021-12-06 19:03:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16927 states to 16927 states and 19745 transitions. [2021-12-06 19:03:22,455 INFO L78 Accepts]: Start accepts. Automaton has 16927 states and 19745 transitions. Word has length 165 [2021-12-06 19:03:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:22,455 INFO L470 AbstractCegarLoop]: Abstraction has 16927 states and 19745 transitions. [2021-12-06 19:03:22,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2021-12-06 19:03:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 16927 states and 19745 transitions. [2021-12-06 19:03:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-06 19:03:22,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:22,462 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-06 19:03:22,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 19:03:22,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-06 19:03:22,663 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 994864062, now seen corresponding path program 1 times [2021-12-06 19:03:22,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:22,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524556659] [2021-12-06 19:03:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:22,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:03:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 19:03:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 19:03:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 19:03:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 19:03:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-06 19:03:22,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524556659] [2021-12-06 19:03:22,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524556659] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191149677] [2021-12-06 19:03:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:22,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:22,744 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:22,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 19:03:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:22,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:03:22,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:03:22,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:22,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191149677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:22,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:22,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:03:22,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483552393] [2021-12-06 19:03:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:22,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:03:22,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:22,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:03:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:03:22,922 INFO L87 Difference]: Start difference. First operand 16927 states and 19745 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 19:03:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:24,008 INFO L93 Difference]: Finished difference Result 26344 states and 30861 transitions. [2021-12-06 19:03:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:03:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2021-12-06 19:03:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:24,037 INFO L225 Difference]: With dead ends: 26344 [2021-12-06 19:03:24,037 INFO L226 Difference]: Without dead ends: 15636 [2021-12-06 19:03:24,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:03:24,054 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 137 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:03:24,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 699 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:03:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15636 states. [2021-12-06 19:03:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15636 to 15632. [2021-12-06 19:03:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15632 states, 13348 states have (on average 1.1390470482469284) internal successors, (15204), 13486 states have internal predecessors, (15204), 1183 states have call successors, (1183), 910 states have call predecessors, (1183), 1099 states have return successors, (1809), 1237 states have call predecessors, (1809), 1180 states have call successors, (1809) [2021-12-06 19:03:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15632 states to 15632 states and 18196 transitions. [2021-12-06 19:03:25,232 INFO L78 Accepts]: Start accepts. Automaton has 15632 states and 18196 transitions. Word has length 200 [2021-12-06 19:03:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:25,232 INFO L470 AbstractCegarLoop]: Abstraction has 15632 states and 18196 transitions. [2021-12-06 19:03:25,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 19:03:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 15632 states and 18196 transitions. [2021-12-06 19:03:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-06 19:03:25,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:25,236 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:03:25,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-06 19:03:25,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:25,438 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:25,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1498322473, now seen corresponding path program 1 times [2021-12-06 19:03:25,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:25,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020854865] [2021-12-06 19:03:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:25,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:03:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:03:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:03:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 19:03:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-06 19:03:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-06 19:03:25,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020854865] [2021-12-06 19:03:25,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020854865] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:03:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168808057] [2021-12-06 19:03:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:25,534 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:25,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:03:25,535 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:03:25,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 19:03:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:25,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:03:25,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:03:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 19:03:25,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:03:25,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168808057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:25,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:03:25,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 19:03:25,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720607870] [2021-12-06 19:03:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:25,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:03:25,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:03:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:03:25,732 INFO L87 Difference]: Start difference. First operand 15632 states and 18196 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 19:03:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:26,785 INFO L93 Difference]: Finished difference Result 24946 states and 29614 transitions. [2021-12-06 19:03:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:03:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2021-12-06 19:03:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:26,814 INFO L225 Difference]: With dead ends: 24946 [2021-12-06 19:03:26,815 INFO L226 Difference]: Without dead ends: 15542 [2021-12-06 19:03:26,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:03:26,833 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 105 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 682 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 [2021-12-06 19:03:26,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 682 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:03:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2021-12-06 19:03:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15448. [2021-12-06 19:03:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15448 states, 13184 states have (on average 1.1215109223300972) internal successors, (14786), 13312 states have internal predecessors, (14786), 1183 states have call successors, (1183), 910 states have call predecessors, (1183), 1079 states have return successors, (1785), 1227 states have call predecessors, (1785), 1180 states have call successors, (1785) [2021-12-06 19:03:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 17754 transitions. [2021-12-06 19:03:27,995 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 17754 transitions. Word has length 201 [2021-12-06 19:03:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:27,995 INFO L470 AbstractCegarLoop]: Abstraction has 15448 states and 17754 transitions. [2021-12-06 19:03:27,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 19:03:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 17754 transitions. [2021-12-06 19:03:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-06 19:03:28,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:28,001 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-12-06 19:03:28,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-06 19:03:28,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:28,202 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1332935587, now seen corresponding path program 1 times [2021-12-06 19:03:28,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861927135] [2021-12-06 19:03:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:28,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:03:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:03:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:03:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 19:03:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 19:03:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-06 19:03:28,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:28,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861927135] [2021-12-06 19:03:28,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861927135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:28,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:03:28,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:03:28,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899785363] [2021-12-06 19:03:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:28,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:03:28,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:28,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:03:28,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:03:28,301 INFO L87 Difference]: Start difference. First operand 15448 states and 17754 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:03:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:30,487 INFO L93 Difference]: Finished difference Result 33736 states and 38551 transitions. [2021-12-06 19:03:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 19:03:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2021-12-06 19:03:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:30,523 INFO L225 Difference]: With dead ends: 33736 [2021-12-06 19:03:30,524 INFO L226 Difference]: Without dead ends: 22894 [2021-12-06 19:03:30,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:03:30,542 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 1169 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:03:30,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1216 Valid, 1457 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:03:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22894 states. [2021-12-06 19:03:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22894 to 19485. [2021-12-06 19:03:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 16611 states have (on average 1.1101077599181266) internal successors, (18440), 16842 states have internal predecessors, (18440), 1456 states have call successors, (1456), 1108 states have call predecessors, (1456), 1416 states have return successors, (2245), 1536 states have call predecessors, (2245), 1453 states have call successors, (2245) [2021-12-06 19:03:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 22141 transitions. [2021-12-06 19:03:32,032 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 22141 transitions. Word has length 203 [2021-12-06 19:03:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:32,032 INFO L470 AbstractCegarLoop]: Abstraction has 19485 states and 22141 transitions. [2021-12-06 19:03:32,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:03:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 22141 transitions. [2021-12-06 19:03:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-06 19:03:32,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:32,038 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:03:32,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-06 19:03:32,038 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 424573701, now seen corresponding path program 1 times [2021-12-06 19:03:32,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:32,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611083029] [2021-12-06 19:03:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:32,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:03:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:03:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:03:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:03:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:03:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:03:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:03:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:03:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 19:03:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:03:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 19:03:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:03:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-06 19:03:32,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:03:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611083029] [2021-12-06 19:03:32,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611083029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:03:32,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:03:32,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:03:32,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71407760] [2021-12-06 19:03:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:03:32,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:03:32,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:03:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:03:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:03:32,091 INFO L87 Difference]: Start difference. First operand 19485 states and 22141 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:03:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:33,856 INFO L93 Difference]: Finished difference Result 30987 states and 36119 transitions. [2021-12-06 19:03:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:03:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2021-12-06 19:03:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:33,901 INFO L225 Difference]: With dead ends: 30987 [2021-12-06 19:03:33,901 INFO L226 Difference]: Without dead ends: 22202 [2021-12-06 19:03:33,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:03:33,920 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 303 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:03:33,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 898 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:03:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22202 states. [2021-12-06 19:03:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22202 to 19489. [2021-12-06 19:03:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19489 states, 16615 states have (on average 1.1100812518808305) internal successors, (18444), 16846 states have internal predecessors, (18444), 1456 states have call successors, (1456), 1108 states have call predecessors, (1456), 1416 states have return successors, (2245), 1536 states have call predecessors, (2245), 1453 states have call successors, (2245) [2021-12-06 19:03:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19489 states to 19489 states and 22145 transitions. [2021-12-06 19:03:35,465 INFO L78 Accepts]: Start accepts. Automaton has 19489 states and 22145 transitions. Word has length 207 [2021-12-06 19:03:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:35,465 INFO L470 AbstractCegarLoop]: Abstraction has 19489 states and 22145 transitions. [2021-12-06 19:03:35,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:03:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 19489 states and 22145 transitions. [2021-12-06 19:03:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-06 19:03:35,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:35,470 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:03:35,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-06 19:03:35,470 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1505939270, now seen corresponding path program 1 times [2021-12-06 19:03:35,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:35,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605567749] [2021-12-06 19:03:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:35,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:03:35,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 19:03:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:03:35,585 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 19:03:35,585 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 19:03:35,586 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 19:03:35,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 19:03:35,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-06 19:03:35,589 INFO L732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:03:35,592 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:03:35,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:03:35 BoogieIcfgContainer [2021-12-06 19:03:35,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:03:35,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:03:35,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:03:35,722 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:03:35,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:02:16" (3/4) ... [2021-12-06 19:03:35,724 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 19:03:35,834 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:03:35,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:03:35,834 INFO L158 Benchmark]: Toolchain (without parser) took 80625.67ms. Allocated memory was 92.3MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 54.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-06 19:03:35,834 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 71.7MB in the beginning and 71.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:03:35,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.59ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 62.1MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 19:03:35,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.33ms. Allocated memory is still 92.3MB. Free memory was 62.1MB in the beginning and 59.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:03:35,835 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 92.3MB. Free memory was 59.2MB in the beginning and 57.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:03:35,835 INFO L158 Benchmark]: RCFGBuilder took 530.82ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 66.2MB in the end (delta: -9.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2021-12-06 19:03:35,835 INFO L158 Benchmark]: TraceAbstraction took 79603.12ms. Allocated memory was 111.1MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 86.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-06 19:03:35,835 INFO L158 Benchmark]: Witness Printer took 112.01ms. Allocated memory is still 3.0GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 35.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-06 19:03:35,836 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.15ms. Allocated memory is still 92.3MB. Free memory was 71.7MB in the beginning and 71.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.59ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 62.1MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.33ms. Allocated memory is still 92.3MB. Free memory was 62.1MB in the beginning and 59.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 92.3MB. Free memory was 59.2MB in the beginning and 57.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.82ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 66.2MB in the end (delta: -9.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 79603.12ms. Allocated memory was 111.1MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 86.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 112.01ms. Allocated memory is still 3.0GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 35.8MB). Peak memory consumption was 37.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 t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] 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_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L595] t1_pc = 1 [L596] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND TRUE t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L631] t2_pc = 1 [L632] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET transmit2() [L769] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] tmp = exists_runnable_thread2() [L774] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] 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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET master() [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L601] token += 1 [L602] E_2 = 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L595] t1_pc = 1 [L596] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND FALSE !(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L637] token += 1 [L638] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L631] t2_pc = 1 [L632] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET transmit2() [L769] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] tmp = exists_runnable_thread2() [L774] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - 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, 241 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 79.4s, OverallIterations: 45, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21914 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21413 mSDsluCounter, 41559 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25832 mSDsCounter, 4281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17716 IncrementalHoareTripleChecker+Invalid, 21997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4281 mSolverCounterUnsat, 15727 mSDtfsCounter, 17716 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4439 GetRequests, 3948 SyntacticMatches, 6 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32386occurred in iteration=33, InterpolantAutomatonStates: 417, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 22860 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 8344 NumberOfCodeBlocks, 8344 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8146 ConstructedInterpolants, 0 QuantifiedInterpolants, 15109 SizeOfPredicates, 9 NumberOfNonLiveVariables, 10191 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 64 InterpolantComputations, 43 PerfectInterpolantSequences, 3836/4182 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! [2021-12-06 19:03:35,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a34776ec-a970-4f07-8c85-56b07ba78d4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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